<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>Faiss: /data/users/hoss/faiss/IndexHNSW.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Faiss
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Friends</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">/data/users/hoss/faiss/IndexHNSW.cpp</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright (c) Facebook, Inc. and its affiliates.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This source code is licensed under the MIT license found in the</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;</div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">// -*- c++ -*-</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;</div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor">#include &quot;IndexHNSW.h&quot;</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;</div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#include &lt;cassert&gt;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="preprocessor">#include &lt;cstring&gt;</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="preprocessor">#include &lt;cstdio&gt;</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="preprocessor">#include &lt;cmath&gt;</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#include &lt;omp.h&gt;</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;</div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#include &lt;unordered_set&gt;</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include &lt;queue&gt;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;</div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#include &lt;sys/types.h&gt;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#include &lt;sys/stat.h&gt;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor">#include &lt;unistd.h&gt;</span></div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="preprocessor">#include &lt;stdint.h&gt;</span></div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="preprocessor">#ifdef __SSE__</span></div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#include &lt;immintrin.h&gt;</span></div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#include &quot;utils.h&quot;</span></div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">#include &quot;Heap.h&quot;</span></div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">#include &quot;FaissAssert.h&quot;</span></div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor">#include &quot;IndexFlat.h&quot;</span></div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor">#include &quot;IndexIVFPQ.h&quot;</span></div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="preprocessor">#include &quot;AuxIndexStructures.h&quot;</span></div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="keyword">extern</span> <span class="stringliteral">&quot;C&quot;</span> {</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">/* declare BLAS functions, see http://www.netlib.org/clapack/cblas/ */</span></div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="keywordtype">int</span> sgemm_ (<span class="keyword">const</span> <span class="keywordtype">char</span> *transa, <span class="keyword">const</span> <span class="keywordtype">char</span> *transb, FINTEGER *m, FINTEGER *</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;            n, FINTEGER *k, <span class="keyword">const</span> <span class="keywordtype">float</span> *alpha, <span class="keyword">const</span> <span class="keywordtype">float</span> *a,</div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            FINTEGER *lda, <span class="keyword">const</span> <span class="keywordtype">float</span> *b, FINTEGER *</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ldb, <span class="keywordtype">float</span> *beta, <span class="keywordtype">float</span> *c, FINTEGER *ldc);</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;}</div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="keyword">namespace </span>faiss {</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keyword">using</span> idx_t = <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a>;</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="keyword">using</span> MinimaxHeap = HNSW::MinimaxHeap;</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="keyword">using</span> storage_idx_t = <a class="code" href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">HNSW::storage_idx_t</a>;</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="keyword">using</span> NodeDistCloser = HNSW::NodeDistCloser;</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="keyword">using</span> NodeDistFarther = HNSW::NodeDistFarther;</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;HNSWStats hnsw_stats;</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="comment"> * add / search blocks of descriptors</span></div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="keywordtype">void</span> hnsw_add_vertices(IndexHNSW &amp;index_hnsw,</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;                       <span class="keywordtype">size_t</span> n0,</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;                       <span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x,</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                       <span class="keywordtype">bool</span> verbose,</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                       <span class="keywordtype">bool</span> preset_levels = <span class="keyword">false</span>) {</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;    <span class="keywordtype">size_t</span> d = index_hnsw.d;</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    HNSW &amp; hnsw = index_hnsw.hnsw;</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    <span class="keywordtype">size_t</span> ntotal = n0 + n;</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    <span class="keywordtype">double</span> t0 = <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>();</div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    <span class="keywordflow">if</span> (verbose) {</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        printf(<span class="stringliteral">&quot;hnsw_add_vertices: adding %ld elements on top of %ld &quot;</span></div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;               <span class="stringliteral">&quot;(preset_levels=%d)\n&quot;</span>,</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;               n, n0, <span class="keywordtype">int</span>(preset_levels));</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    }</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    <span class="keywordflow">if</span> (n == 0) {</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    }</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    <span class="keywordtype">int</span> max_level = hnsw.prepare_level_tab(n, preset_levels);</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    <span class="keywordflow">if</span> (verbose) {</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        printf(<span class="stringliteral">&quot;  max_level = %d\n&quot;</span>, max_level);</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    }</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;    std::vector&lt;omp_lock_t&gt; locks(ntotal);</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; ntotal; i++)</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        omp_init_lock(&amp;locks[i]);</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;    <span class="comment">// add vectors from highest to lowest level</span></div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    std::vector&lt;int&gt; hist;</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    std::vector&lt;int&gt; order(n);</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;    { <span class="comment">// make buckets with vectors of the same level</span></div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="comment">// build histogram</span></div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            storage_idx_t pt_id = i + n0;</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            <span class="keywordtype">int</span> pt_level = hnsw.levels[pt_id] - 1;</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            <span class="keywordflow">while</span> (pt_level &gt;= hist.size())</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;                hist.push_back(0);</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;            hist[pt_level] ++;</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        }</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="comment">// accumulate</span></div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        std::vector&lt;int&gt; offsets(hist.size() + 1, 0);</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; hist.size() - 1; i++) {</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;            offsets[i + 1] = offsets[i] + hist[i];</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        }</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        <span class="comment">// bucket sort</span></div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;            storage_idx_t pt_id = i + n0;</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;            <span class="keywordtype">int</span> pt_level = hnsw.levels[pt_id] - 1;</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            order[offsets[pt_level]++] = pt_id;</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        }</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    }</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;    idx_t check_period = <a class="code" href="structfaiss_1_1InterruptCallback.html#a1e4134a6b41f93d2405e030527573728">InterruptCallback::get_period_hint</a></div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        (max_level * index_hnsw.d * hnsw.efConstruction);</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    { <span class="comment">// perform add</span></div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        RandomGenerator rng2(789);</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        <span class="keywordtype">int</span> i1 = n;</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pt_level = hist.size() - 1; pt_level &gt;= 0; pt_level--) {</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;            <span class="keywordtype">int</span> i0 = i1 - hist[pt_level];</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;            <span class="keywordflow">if</span> (verbose) {</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                printf(<span class="stringliteral">&quot;Adding %d elements at level %d\n&quot;</span>,</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                       i1 - i0, pt_level);</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;            }</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;            <span class="comment">// random permutation to get rid of dataset order bias</span></div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i0; j &lt; i1; j++)</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                std::swap(order[j], order[j + rng2.rand_int(i1 - j)]);</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;            <span class="keywordtype">bool</span> interrupt = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;</div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;<span class="preprocessor">#pragma omp parallel if(i1 &gt; i0 + 100)</span></div>
<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="preprocessor"></span>            {</div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                VisitedTable vt (ntotal);</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                DistanceComputer *dis = index_hnsw.get_distance_computer();</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                ScopeDeleter1&lt;DistanceComputer&gt; del(dis);</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                <span class="keywordtype">int</span> prev_display = verbose &amp;&amp; omp_get_thread_num() == 0 ? 0 : -1;</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                <span class="keywordtype">size_t</span> counter = 0;</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="preprocessor">#pragma omp  for schedule(dynamic)</span></div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;<span class="preprocessor"></span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = i0; i &lt; i1; i++) {</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                    storage_idx_t pt_id = order[i];</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;                    dis-&gt;set_query (x + (pt_id - n0) * d);</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;</div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                    <span class="comment">// cannot break</span></div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                    <span class="keywordflow">if</span> (interrupt) {</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                        <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;                    }</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                    hnsw.add_with_locks(*dis, pt_level, pt_id, locks, vt);</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                    <span class="keywordflow">if</span> (prev_display &gt;= 0 &amp;&amp; i - i0 &gt; prev_display + 10000) {</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;                        prev_display = i - i0;</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                        printf(<span class="stringliteral">&quot;  %d / %d\r&quot;</span>, i - i0, i1 - i0);</div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;                        fflush(stdout);</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                    }</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                    <span class="keywordflow">if</span> (counter % check_period == 0) {</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;<span class="preprocessor"></span>                        {</div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                            <span class="keywordflow">if</span> (<a class="code" href="structfaiss_1_1InterruptCallback.html#adb241fbde51ecd1003cefb8295cd1e0d">InterruptCallback::is_interrupted</a> ()) {</div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                                interrupt = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                            }</div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                        }</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                    }</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    counter++;</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                }</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;            }</div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;            <span class="keywordflow">if</span> (interrupt) {</div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                FAISS_THROW_MSG (<span class="stringliteral">&quot;computation interrupted&quot;</span>);</div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;            }</div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;            i1 = i0;</div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;        }</div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;        FAISS_ASSERT(i1 == 0);</div>
<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;    }</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;    <span class="keywordflow">if</span> (verbose) {</div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;        printf(<span class="stringliteral">&quot;Done in %.3f ms\n&quot;</span>, <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>() - t0);</div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;    }</div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;</div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; ntotal; i++) {</div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;        omp_destroy_lock(&amp;locks[i]);</div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;    }</div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;}</div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;}  <span class="comment">// namespace</span></div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;<span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="comment"> * IndexHNSW implementation</span></div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;IndexHNSW::IndexHNSW(<span class="keywordtype">int</span> d, <span class="keywordtype">int</span> M):</div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;    Index(d, METRIC_L2),</div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;    hnsw(M),</div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;    own_fields(false),</div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;    storage(nullptr),</div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;    reconstruct_from_neighbors(nullptr)</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;{}</div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;IndexHNSW::IndexHNSW(Index *storage, <span class="keywordtype">int</span> M):</div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;    Index(storage-&gt;d, METRIC_L2),</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;    hnsw(M),</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;    own_fields(false),</div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;    storage(storage),</div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;    reconstruct_from_neighbors(nullptr)</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;{}</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;IndexHNSW::~IndexHNSW() {</div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;    <span class="keywordflow">if</span> (own_fields) {</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <span class="keyword">delete</span> storage;</div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;    }</div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;}</div>
<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;</div>
<div class="line"><a name="l00236"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a40bc6d2c67545f95e322c63d68a47140">  236</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a40bc6d2c67545f95e322c63d68a47140">IndexHNSW::train</a>(<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> n, <span class="keyword">const</span> <span class="keywordtype">float</span>* x)</div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;{</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;    <span class="comment">// hnsw structure does not require training</span></div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    storage-&gt;<a class="code" href="structfaiss_1_1Index.html#abf601502bdbfa02b9d7bcd7b3671b71d">train</a> (n, x);</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;    <a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a> = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;}</div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;</div>
<div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#ae0ddf6ab4a54239a25d6277e21e8548e">  243</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#ae0ddf6ab4a54239a25d6277e21e8548e">IndexHNSW::search</a> (<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x, <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> k,</div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;                        <span class="keywordtype">float</span> *distances, <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> *labels)<span class="keyword"> const</span></div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;<span class="keyword"></span></div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;    <span class="keywordtype">size_t</span> nreorder = 0;</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;    <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> check_period = <a class="code" href="structfaiss_1_1InterruptCallback.html#a1e4134a6b41f93d2405e030527573728">InterruptCallback::get_period_hint</a> (</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;          hnsw.max_level * d * hnsw.efSearch);</div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;    <span class="keywordflow">for</span> (<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> i0 = 0; i0 &lt; n; i0 += check_period) {</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> i1 = std::min(i0 + check_period, n);</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;</div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;<span class="preprocessor">#pragma omp parallel reduction(+ : nreorder)</span></div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;<span class="preprocessor"></span>        {</div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;            <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> vt (ntotal);</div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;            <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> *dis = get_distance_computer();</div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;            <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1&lt;DistanceComputer&gt;</a> del(dis);</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;<span class="preprocessor"></span>            <span class="keywordflow">for</span>(<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> i = i0; i &lt; i1; i++) {</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;                <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> * idxi = labels + i * k;</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;                <span class="keywordtype">float</span> * simi = distances + i * k;</div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;                dis-&gt;<a class="code" href="structfaiss_1_1DistanceComputer.html#aaa4472453365b786adc2ab21e9cee5ec">set_query</a>(x + i * d);</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;                maxheap_heapify (k, simi, idxi);</div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;                hnsw.search(*dis, k, idxi, simi, vt);</div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;</div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;                maxheap_reorder (k, simi, idxi);</div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;</div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;                <span class="keywordflow">if</span> (reconstruct_from_neighbors &amp;&amp;</div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;                    reconstruct_from_neighbors-&gt;k_reorder != 0) {</div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;                    <span class="keywordtype">int</span> k_reorder = reconstruct_from_neighbors-&gt;k_reorder;</div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;                    <span class="keywordflow">if</span> (k_reorder == -1 || k_reorder &gt; k) k_reorder = k;</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;</div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;                    nreorder += reconstruct_from_neighbors-&gt;compute_distances(</div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;                             k_reorder, idxi, x + i * d, simi);</div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;</div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;                    <span class="comment">// sort top k_reorder</span></div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;                    maxheap_heapify (k_reorder, simi, idxi, simi, idxi, k_reorder);</div>
<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;                    maxheap_reorder (k_reorder, simi, idxi);</div>
<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;                }</div>
<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;</div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;            }</div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;</div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;        }</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        <a class="code" href="structfaiss_1_1InterruptCallback.html#a6b7b2569b2d3a88daea65b469a24e378">InterruptCallback::check</a> ();</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;    }</div>
<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;    hnsw_stats.nreorder += nreorder;</div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;}</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;</div>
<div class="line"><a name="l00294"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a04a761ce17d0f9040b3bc8a77bd627d9">  294</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a04a761ce17d0f9040b3bc8a77bd627d9">IndexHNSW::add</a>(<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x)</div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;{</div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;    FAISS_THROW_IF_NOT(<a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a>);</div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;    <span class="keywordtype">int</span> n0 = <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>;</div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;    storage-&gt;<a class="code" href="structfaiss_1_1Index.html#a1b5e9ac70adbce0897dd6c8276ad96f2">add</a>(n, x);</div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;    ntotal = storage-&gt;<a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>;</div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;</div>
<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;    hnsw_add_vertices (*<span class="keyword">this</span>, n0, n, x, verbose,</div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;                       hnsw.levels.size() == <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>);</div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;}</div>
<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;</div>
<div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#ad4b9f97d42e2521e01f8b60012985396">  305</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#ad4b9f97d42e2521e01f8b60012985396">IndexHNSW::reset</a>()</div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;{</div>
<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;    hnsw.reset();</div>
<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;    storage-&gt;<a class="code" href="structfaiss_1_1Index.html#a849361f5f0ab0aba8d419c86f2594191">reset</a>();</div>
<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;    ntotal = 0;</div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;}</div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;</div>
<div class="line"><a name="l00312"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a660e5c8de1ba9c71bf3fe1f3bf0c8812">  312</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a660e5c8de1ba9c71bf3fe1f3bf0c8812">IndexHNSW::reconstruct</a> (<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> key, <span class="keywordtype">float</span>* recons)<span class="keyword"> const</span></div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;    storage-&gt;<a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a>(key, recons);</div>
<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;}</div>
<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;</div>
<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;<span class="keywordtype">void</span> IndexHNSW::shrink_level_0_neighbors(<span class="keywordtype">int</span> new_size)</div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;{</div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;<span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;<span class="preprocessor"></span>    {</div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;        <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> *dis = get_distance_computer();</div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;        <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1&lt;DistanceComputer&gt;</a> del(dis);</div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;</div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;<span class="preprocessor"></span>        <span class="keywordflow">for</span> (idx_t i = 0; i &lt; <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;            <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            hnsw.neighbor_range(i, 0, &amp;begin, &amp;end);</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;</div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;            std::priority_queue&lt;NodeDistFarther&gt; initial_list;</div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;                <span class="keywordtype">int</span> v1 = hnsw.neighbors[j];</div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;                <span class="keywordflow">if</span> (v1 &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;                initial_list.emplace(dis-&gt;<a class="code" href="structfaiss_1_1DistanceComputer.html#a4b7236a757c788401aac00598ed902c7">symmetric_dis</a>(i, v1), v1);</div>
<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;</div>
<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;                <span class="comment">// initial_list.emplace(qdis(v1), v1);</span></div>
<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;            }</div>
<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;</div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;            std::vector&lt;NodeDistFarther&gt; shrunk_list;</div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;            <a class="code" href="structfaiss_1_1HNSW.html#a0cf1870a859783925e95b15bf5e83584">HNSW::shrink_neighbor_list</a>(*dis, initial_list,</div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;                                       shrunk_list, new_size);</div>
<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;</div>
<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;                <span class="keywordflow">if</span> (j - begin &lt; shrunk_list.size())</div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;                    hnsw.neighbors[j] = shrunk_list[j - begin].id;</div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;                    hnsw.neighbors[j] = -1;</div>
<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;            }</div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;        }</div>
<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;    }</div>
<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;</div>
<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;}</div>
<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;</div>
<div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a5b619a41ddd52f0377efb701829c1e43">  355</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a5b619a41ddd52f0377efb701829c1e43">IndexHNSW::search_level_0</a>(</div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;    <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x, <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> k,</div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;    <span class="keyword">const</span> storage_idx_t *nearest, <span class="keyword">const</span> <span class="keywordtype">float</span> *nearest_d,</div>
<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;    <span class="keywordtype">float</span> *distances, <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> *labels, <span class="keywordtype">int</span> nprobe,</div>
<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;    <span class="keywordtype">int</span> search_type)<span class="keyword"> const</span></div>
<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;</div>
<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;    storage_idx_t ntotal = hnsw.levels.size();</div>
<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;<span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;<span class="preprocessor"></span>    {</div>
<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;        <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> *qdis = get_distance_computer();</div>
<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;        <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1&lt;DistanceComputer&gt;</a> del(qdis);</div>
<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;</div>
<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;        <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> vt (ntotal);</div>
<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;</div>
<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;<span class="preprocessor"></span>        <span class="keywordflow">for</span>(<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;            <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> * idxi = labels + i * k;</div>
<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;            <span class="keywordtype">float</span> * simi = distances + i * k;</div>
<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;</div>
<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;            qdis-&gt;<a class="code" href="structfaiss_1_1DistanceComputer.html#aaa4472453365b786adc2ab21e9cee5ec">set_query</a>(x + i * d);</div>
<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;            maxheap_heapify (k, simi, idxi);</div>
<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;</div>
<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;            <span class="keywordflow">if</span> (search_type == 1) {</div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;</div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;                <span class="keywordtype">int</span> nres = 0;</div>
<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;</div>
<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j &lt; nprobe; j++) {</div>
<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;                    storage_idx_t cj = nearest[i * nprobe + j];</div>
<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;</div>
<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;                    <span class="keywordflow">if</span> (cj &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;</div>
<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;                    <span class="keywordflow">if</span> (vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a18a972137362ff04a38943d66fc19dcb">get</a>(cj)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;</div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;                    <span class="keywordtype">int</span> candidates_size = std::max(hnsw.efSearch, <span class="keywordtype">int</span>(k));</div>
<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;                    <a class="code" href="structfaiss_1_1HNSW_1_1MinimaxHeap.html">MinimaxHeap</a> candidates(candidates_size);</div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;</div>
<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;                    candidates.push(cj, nearest_d[i * nprobe + j]);</div>
<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;</div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;                    nres = hnsw.search_from_candidates(</div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;                      *qdis, k, idxi, simi,</div>
<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;                      candidates, vt, 0, nres</div>
<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;                    );</div>
<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;                }</div>
<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (search_type == 2) {</div>
<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;</div>
<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;                <span class="keywordtype">int</span> candidates_size = std::max(hnsw.efSearch, <span class="keywordtype">int</span>(k));</div>
<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;                candidates_size = std::max(candidates_size, nprobe);</div>
<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;</div>
<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;                <a class="code" href="structfaiss_1_1HNSW_1_1MinimaxHeap.html">MinimaxHeap</a> candidates(candidates_size);</div>
<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j &lt; nprobe; j++) {</div>
<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;                    storage_idx_t cj = nearest[i * nprobe + j];</div>
<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;</div>
<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;                    <span class="keywordflow">if</span> (cj &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;                    candidates.push(cj, nearest_d[i * nprobe + j]);</div>
<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;                }</div>
<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;                hnsw.search_from_candidates(</div>
<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;                  *qdis, k, idxi, simi,</div>
<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;                  candidates, vt, 0</div>
<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;                );</div>
<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;</div>
<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;            }</div>
<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;            vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>();</div>
<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;</div>
<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;            maxheap_reorder (k, simi, idxi);</div>
<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;</div>
<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;        }</div>
<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;    }</div>
<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;</div>
<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;</div>
<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;}</div>
<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;</div>
<div class="line"><a name="l00427"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#a9a86c58212f3f9cf88394f5297cba525">  427</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#a9a86c58212f3f9cf88394f5297cba525">IndexHNSW::init_level_0_from_knngraph</a>(</div>
<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;       <span class="keywordtype">int</span> k, <span class="keyword">const</span> <span class="keywordtype">float</span> *D, <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> *I)</div>
<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;{</div>
<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;    <span class="keywordtype">int</span> dest_size = hnsw.nb_neighbors (0);</div>
<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;</div>
<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;<span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;<span class="preprocessor"></span>    <span class="keywordflow">for</span> (<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> i = 0; i &lt; <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;        <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> *qdis = get_distance_computer();</div>
<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;        <span class="keywordtype">float</span> vec[<a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>];</div>
<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;        storage-&gt;<a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a>(i, vec);</div>
<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;        qdis-&gt;<a class="code" href="structfaiss_1_1DistanceComputer.html#aaa4472453365b786adc2ab21e9cee5ec">set_query</a>(vec);</div>
<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;</div>
<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;        std::priority_queue&lt;NodeDistFarther&gt; initial_list;</div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;</div>
<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; k; j++) {</div>
<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;            <span class="keywordtype">int</span> v1 = I[i * k + j];</div>
<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;            <span class="keywordflow">if</span> (v1 == i) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;            <span class="keywordflow">if</span> (v1 &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;            initial_list.emplace(D[i * k + j], v1);</div>
<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;        }</div>
<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;</div>
<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;        std::vector&lt;NodeDistFarther&gt; shrunk_list;</div>
<div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;        <a class="code" href="structfaiss_1_1HNSW.html#a0cf1870a859783925e95b15bf5e83584">HNSW::shrink_neighbor_list</a>(*qdis, initial_list, shrunk_list, dest_size);</div>
<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;</div>
<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;        <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;        hnsw.neighbor_range(i, 0, &amp;begin, &amp;end);</div>
<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;</div>
<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;            <span class="keywordflow">if</span> (j - begin &lt; shrunk_list.size())</div>
<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;                hnsw.neighbors[j] = shrunk_list[j - begin].id;</div>
<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;            <span class="keywordflow">else</span></div>
<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;                hnsw.neighbors[j] = -1;</div>
<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        }</div>
<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;    }</div>
<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;}</div>
<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;</div>
<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;</div>
<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;</div>
<div class="line"><a name="l00465"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW.html#ab9c75063090927f8f65d1896b6949af4">  465</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW.html#ab9c75063090927f8f65d1896b6949af4">IndexHNSW::init_level_0_from_entry_points</a>(</div>
<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;          <span class="keywordtype">int</span> n, <span class="keyword">const</span> storage_idx_t *points,</div>
<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;          <span class="keyword">const</span> storage_idx_t *nearests)</div>
<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;{</div>
<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;</div>
<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;    std::vector&lt;omp_lock_t&gt; locks(ntotal);</div>
<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++)</div>
<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;        omp_init_lock(&amp;locks[i]);</div>
<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;</div>
<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;<span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;<span class="preprocessor"></span>    {</div>
<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;        <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> vt (ntotal);</div>
<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;</div>
<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;        <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> *dis = get_distance_computer();</div>
<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;        <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1&lt;DistanceComputer&gt;</a> del(dis);</div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;        <span class="keywordtype">float</span> vec[storage-&gt;<a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>];</div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;</div>
<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;<span class="preprocessor">#pragma omp  for schedule(dynamic)</span></div>
<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;<span class="preprocessor"></span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;            storage_idx_t pt_id = points[i];</div>
<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;            storage_idx_t nearest = nearests[i];</div>
<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;            storage-&gt;<a class="code" href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">reconstruct</a> (pt_id, vec);</div>
<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;            dis-&gt;<a class="code" href="structfaiss_1_1DistanceComputer.html#aaa4472453365b786adc2ab21e9cee5ec">set_query</a> (vec);</div>
<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;</div>
<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;            hnsw.add_links_starting_from(*dis, pt_id,</div>
<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;                                         nearest, (*dis)(nearest),</div>
<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;                                         0, locks.data(), vt);</div>
<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;</div>
<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;            <span class="keywordflow">if</span> (verbose &amp;&amp; i % 10000 == 0) {</div>
<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;                printf(<span class="stringliteral">&quot;  %d / %d\r&quot;</span>, i, n);</div>
<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;                fflush(stdout);</div>
<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;            }</div>
<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;        }</div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;    }</div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;    <span class="keywordflow">if</span> (verbose) {</div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;        printf(<span class="stringliteral">&quot;\n&quot;</span>);</div>
<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;    }</div>
<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;</div>
<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++)</div>
<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;        omp_destroy_lock(&amp;locks[i]);</div>
<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;}</div>
<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;</div>
<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;<span class="keywordtype">void</span> IndexHNSW::reorder_links()</div>
<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;{</div>
<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;    <span class="keywordtype">int</span> M = hnsw.nb_neighbors(0);</div>
<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;</div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;<span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;<span class="preprocessor"></span>    {</div>
<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;        std::vector&lt;float&gt; distances (M);</div>
<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;        std::vector&lt;size_t&gt; order (M);</div>
<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;        std::vector&lt;storage_idx_t&gt; tmp (M);</div>
<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;        <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> *dis = get_distance_computer();</div>
<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;        <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1&lt;DistanceComputer&gt;</a> del(dis);</div>
<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;</div>
<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;<span class="preprocessor"></span>        <span class="keywordflow">for</span>(storage_idx_t i = 0; i &lt; <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;</div>
<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;            <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;            hnsw.neighbor_range(i, 0, &amp;begin, &amp;end);</div>
<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;</div>
<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;                storage_idx_t nj = hnsw.neighbors[j];</div>
<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;                <span class="keywordflow">if</span> (nj &lt; 0) {</div>
<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;                    end = j;</div>
<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;                    <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;                }</div>
<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;                distances[j - begin] = dis-&gt;<a class="code" href="structfaiss_1_1DistanceComputer.html#a4b7236a757c788401aac00598ed902c7">symmetric_dis</a>(i, nj);</div>
<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;                tmp [j - begin] = nj;</div>
<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;            }</div>
<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;</div>
<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;            fvec_argsort (end - begin, distances.data(), order.data());</div>
<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;                hnsw.neighbors[j] = tmp[order[j - begin]];</div>
<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;            }</div>
<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;        }</div>
<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;</div>
<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;    }</div>
<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;}</div>
<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;</div>
<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;</div>
<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;<span class="keywordtype">void</span> IndexHNSW::link_singletons()</div>
<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;{</div>
<div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;    printf(<span class="stringliteral">&quot;search for singletons\n&quot;</span>);</div>
<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;</div>
<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;    std::vector&lt;bool&gt; seen(ntotal);</div>
<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;</div>
<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;        <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;        hnsw.neighbor_range(i, 0, &amp;begin, &amp;end);</div>
<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;            storage_idx_t ni = hnsw.neighbors[j];</div>
<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;            <span class="keywordflow">if</span> (ni &gt;= 0) seen[ni] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;        }</div>
<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;    }</div>
<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;</div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;    <span class="keywordtype">int</span> n_sing = 0, n_sing_l1 = 0;</div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;    std::vector&lt;storage_idx_t&gt; singletons;</div>
<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;    <span class="keywordflow">for</span> (storage_idx_t i = 0; i &lt; <a class="code" href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">ntotal</a>; i++) {</div>
<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;        <span class="keywordflow">if</span> (!seen[i]) {</div>
<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;            singletons.push_back(i);</div>
<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;            n_sing++;</div>
<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;            <span class="keywordflow">if</span> (hnsw.levels[i] &gt; 1)</div>
<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;                n_sing_l1++;</div>
<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;        }</div>
<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;    }</div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;</div>
<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;    printf(<span class="stringliteral">&quot;  Found %d / %ld singletons (%d appear in a level above)\n&quot;</span>,</div>
<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;           n_sing, ntotal, n_sing_l1);</div>
<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;</div>
<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;    std::vector&lt;float&gt;recons(singletons.size() * <a class="code" href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">d</a>);</div>
<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; singletons.size(); i++) {</div>
<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;</div>
<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;        FAISS_ASSERT(!<span class="stringliteral">&quot;not implemented&quot;</span>);</div>
<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;</div>
<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;    }</div>
<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;</div>
<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;</div>
<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;}</div>
<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;</div>
<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;</div>
<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;</div>
<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;</div>
<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;<span class="comment">// storage that explicitly reconstructs vectors before computing distances</span></div>
<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;<span class="keyword">struct </span>GenericDistanceComputer: DistanceComputer {</div>
<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;    <span class="keywordtype">size_t</span> d;</div>
<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;    <span class="keyword">const</span> Index &amp; storage;</div>
<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;    std::vector&lt;float&gt; buf;</div>
<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">float</span> *q;</div>
<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;</div>
<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;    GenericDistanceComputer(<span class="keyword">const</span> Index &amp; storage): storage(storage)</div>
<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;    {</div>
<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;        d = storage.d;</div>
<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;        buf.resize(d * 2);</div>
<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;    }</div>
<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;</div>
<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;    <span class="keywordtype">float</span> operator () (idx_t i)<span class="keyword"> override</span></div>
<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;        storage.reconstruct(i, buf.data());</div>
<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(q, buf.data(), d);</div>
<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;    }</div>
<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;</div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;    <span class="keywordtype">float</span> symmetric_dis(idx_t i, idx_t j)<span class="keyword"> override</span></div>
<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        storage.reconstruct(i, buf.data());</div>
<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;        storage.reconstruct(j, buf.data() + d);</div>
<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(buf.data() + d, buf.data(), d);</div>
<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;    }</div>
<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;</div>
<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;    <span class="keywordtype">void</span> set_query(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;        q = x;</div>
<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;    }</div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;</div>
<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;</div>
<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;};</div>
<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;</div>
<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;</div>
<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;}  <span class="comment">// namespace</span></div>
<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;</div>
<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;DistanceComputer * IndexHNSW::get_distance_computer ()<span class="keyword"> const</span></div>
<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">new</span> GenericDistanceComputer (*storage);</div>
<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;}</div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;</div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;</div>
<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;<span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;<span class="comment"> * ReconstructFromNeighbors implementation</span></div>
<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;<span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;</div>
<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;</div>
<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;ReconstructFromNeighbors::ReconstructFromNeighbors(</div>
<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;             <span class="keyword">const</span> IndexHNSW &amp; index, <span class="keywordtype">size_t</span> k, <span class="keywordtype">size_t</span> nsq):</div>
<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;    index(index), k(k), nsq(nsq) {</div>
<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;    M = index.hnsw.nb_neighbors(0);</div>
<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;    FAISS_ASSERT(k &lt;= 256);</div>
<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;    code_size = k == 1 ? 0 : nsq;</div>
<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;    ntotal = 0;</div>
<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;    d = index.d;</div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;    FAISS_ASSERT(d % nsq == 0);</div>
<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;    dsub = d / nsq;</div>
<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;    k_reorder = -1;</div>
<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;}</div>
<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;</div>
<div class="line"><a name="l00648"></a><span class="lineno"><a class="line" href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">  648</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">ReconstructFromNeighbors::reconstruct</a>(storage_idx_t i, <span class="keywordtype">float</span> *x, <span class="keywordtype">float</span> *tmp)<span class="keyword"> const</span></div>
<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;</div>
<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;</div>
<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;    <span class="keyword">const</span> <a class="code" href="structfaiss_1_1HNSW.html">HNSW</a> &amp; hnsw = index.hnsw;</div>
<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;    <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;    hnsw.<a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, 0, &amp;begin, &amp;end);</div>
<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;</div>
<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;    <span class="keywordflow">if</span> (k == 1 || nsq == 1) {</div>
<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">float</span> * beta;</div>
<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;        <span class="keywordflow">if</span> (k == 1) {</div>
<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;            beta = codebook.data();</div>
<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;        } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;            <span class="keywordtype">int</span> idx = codes[i];</div>
<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;            beta = codebook.data() + idx * (M + 1);</div>
<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;        }</div>
<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;</div>
<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;        <span class="keywordtype">float</span> w0 = beta[0]; <span class="comment">// weight of image itself</span></div>
<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;        index.storage-&gt;reconstruct(i, tmp);</div>
<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;</div>
<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l &lt; d; l++)</div>
<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;            x[l] = w0 * tmp[l];</div>
<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;</div>
<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;</div>
<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;            storage_idx_t ji = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;            <span class="keywordflow">if</span> (ji &lt; 0) ji = i;</div>
<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;            <span class="keywordtype">float</span> w = beta[j - begin + 1];</div>
<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;            index.storage-&gt;reconstruct(ji, tmp);</div>
<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l &lt; d; l++)</div>
<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;                x[l] += w * tmp[l];</div>
<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;        }</div>
<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nsq == 2) {</div>
<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;        <span class="keywordtype">int</span> idx0 = codes[2 * i];</div>
<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;        <span class="keywordtype">int</span> idx1 = codes[2 * i + 1];</div>
<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;</div>
<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">float</span> *beta0 = codebook.data() +  idx0 * (M + 1);</div>
<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">float</span> *beta1 = codebook.data() + (idx1 + k) * (M + 1);</div>
<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;</div>
<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;        index.storage-&gt;reconstruct(i, tmp);</div>
<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;</div>
<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;        <span class="keywordtype">float</span> w0;</div>
<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;</div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;        w0 = beta0[0];</div>
<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l &lt; dsub; l++)</div>
<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;            x[l] = w0 * tmp[l];</div>
<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;</div>
<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;        w0 = beta1[0];</div>
<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = dsub; l &lt; d; l++)</div>
<div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;            x[l] = w0 * tmp[l];</div>
<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;</div>
<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;            storage_idx_t ji = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;            <span class="keywordflow">if</span> (ji &lt; 0) ji = i;</div>
<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;            index.storage-&gt;reconstruct(ji, tmp);</div>
<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;            <span class="keywordtype">float</span> w;</div>
<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;            w = beta0[j - begin + 1];</div>
<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l &lt; dsub; l++)</div>
<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;                x[l] += w * tmp[l];</div>
<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;</div>
<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;            w = beta1[j - begin + 1];</div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = dsub; l &lt; d; l++)</div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;                x[l] += w * tmp[l];</div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;        }</div>
<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;    } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">float</span> *betas[nsq];</div>
<div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;        {</div>
<div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;            <span class="keyword">const</span> <span class="keywordtype">float</span> *b = codebook.data();</div>
<div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160;            <span class="keyword">const</span> uint8_t *c = &amp;codes[i * code_size];</div>
<div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sq = 0; sq &lt; nsq; sq++) {</div>
<div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;                betas[sq] = b + (*c++) * (M + 1);</div>
<div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160;                b += (M + 1) * k;</div>
<div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;            }</div>
<div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;        }</div>
<div class="line"><a name="l00722"></a><span class="lineno">  722</span>&#160;</div>
<div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;        index.storage-&gt;reconstruct(i, tmp);</div>
<div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;        {</div>
<div class="line"><a name="l00725"></a><span class="lineno">  725</span>&#160;            <span class="keywordtype">int</span> d0 = 0;</div>
<div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sq = 0; sq &lt; nsq; sq++) {</div>
<div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;                <span class="keywordtype">float</span> w = *(betas[sq]++);</div>
<div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;                <span class="keywordtype">int</span> d1 = d0 + dsub;</div>
<div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = d0; l &lt; d1; l++) {</div>
<div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;                    x[l] = w * tmp[l];</div>
<div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;                }</div>
<div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;                d0 = d1;</div>
<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;            }</div>
<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;        }</div>
<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;</div>
<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;            storage_idx_t ji = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;            <span class="keywordflow">if</span> (ji &lt; 0) ji = i;</div>
<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;</div>
<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;            index.storage-&gt;reconstruct(ji, tmp);</div>
<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;            <span class="keywordtype">int</span> d0 = 0;</div>
<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sq = 0; sq &lt; nsq; sq++) {</div>
<div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;                <span class="keywordtype">float</span> w = *(betas[sq]++);</div>
<div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;                <span class="keywordtype">int</span> d1 = d0 + dsub;</div>
<div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = d0; l &lt; d1; l++) {</div>
<div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;                    x[l] += w * tmp[l];</div>
<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;                }</div>
<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;                d0 = d1;</div>
<div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;            }</div>
<div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;        }</div>
<div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;    }</div>
<div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;}</div>
<div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;</div>
<div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160;<span class="keywordtype">void</span> ReconstructFromNeighbors::reconstruct_n(storage_idx_t n0,</div>
<div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;                                             storage_idx_t ni,</div>
<div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;                                             <span class="keywordtype">float</span> *x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;<span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;<span class="preprocessor"></span>    {</div>
<div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;        std::vector&lt;float&gt; tmp(index.d);</div>
<div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;<span class="preprocessor"></span>        <span class="keywordflow">for</span> (storage_idx_t i = 0; i &lt; ni; i++) {</div>
<div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;            <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">reconstruct</a>(n0 + i, x + i * index.d, tmp.data());</div>
<div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;        }</div>
<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;    }</div>
<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;}</div>
<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;</div>
<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;<span class="keywordtype">size_t</span> ReconstructFromNeighbors::compute_distances(</div>
<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;    <span class="keywordtype">size_t</span> n, <span class="keyword">const</span> idx_t *shortlist,</div>
<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">float</span> *query, <span class="keywordtype">float</span> *distances)<span class="keyword"> const</span></div>
<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;    std::vector&lt;float&gt; tmp(2 * index.d);</div>
<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;    <span class="keywordtype">size_t</span> ncomp = 0;</div>
<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;        <span class="keywordflow">if</span> (shortlist[i] &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;        <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">reconstruct</a>(shortlist[i], tmp.data(), tmp.data() + index.d);</div>
<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;        distances[i] = <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(query, tmp.data(), index.d);</div>
<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;        ncomp++;</div>
<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;    }</div>
<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;    <span class="keywordflow">return</span> ncomp;</div>
<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;}</div>
<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;</div>
<div class="line"><a name="l00783"></a><span class="lineno"><a class="line" href="structfaiss_1_1ReconstructFromNeighbors.html#aed256bdd9f48dc93cb9e33cfdfd5bde7">  783</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#aed256bdd9f48dc93cb9e33cfdfd5bde7">ReconstructFromNeighbors::get_neighbor_table</a>(storage_idx_t i, <span class="keywordtype">float</span> *tmp1)<span class="keyword"> const</span></div>
<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;    <span class="keyword">const</span> <a class="code" href="structfaiss_1_1HNSW.html">HNSW</a> &amp; hnsw = index.hnsw;</div>
<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;    <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;    hnsw.<a class="code" href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">neighbor_range</a>(i, 0, &amp;begin, &amp;end);</div>
<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;    <span class="keywordtype">size_t</span> d = index.d;</div>
<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;</div>
<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;    index.storage-&gt;reconstruct(i, tmp1);</div>
<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;</div>
<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;        storage_idx_t ji = hnsw.<a class="code" href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">neighbors</a>[j];</div>
<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;        <span class="keywordflow">if</span> (ji &lt; 0) ji = i;</div>
<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;        index.storage-&gt;reconstruct(ji, tmp1 + (j - begin + 1) * d);</div>
<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;    }</div>
<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;</div>
<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;}</div>
<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;</div>
<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;<span class="comment">/// called by add_codes</span></div>
<div class="line"><a name="l00802"></a><span class="lineno"><a class="line" href="structfaiss_1_1ReconstructFromNeighbors.html#a88ca99742dccc52ebb3324b507b6c872">  802</a></span>&#160;<span class="comment"></span><span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a88ca99742dccc52ebb3324b507b6c872">ReconstructFromNeighbors::estimate_code</a>(</div>
<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;       <span class="keyword">const</span> <span class="keywordtype">float</span> *x, storage_idx_t i, uint8_t *code)<span class="keyword"> const</span></div>
<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;</div>
<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;    <span class="comment">// fill in tmp table with the neighbor values</span></div>
<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;    <span class="keywordtype">float</span> *tmp1 = <span class="keyword">new</span> <span class="keywordtype">float</span>[d * (M + 1) + (d * k)];</div>
<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;    <span class="keywordtype">float</span> *tmp2 = tmp1 + d * (M + 1);</div>
<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;    <a class="code" href="structfaiss_1_1ScopeDeleter.html">ScopeDeleter&lt;float&gt;</a> del(tmp1);</div>
<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;</div>
<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;    <span class="comment">// collect coordinates of base</span></div>
<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;    <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#aed256bdd9f48dc93cb9e33cfdfd5bde7">get_neighbor_table</a> (i, tmp1);</div>
<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;</div>
<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> sq = 0; sq &lt; nsq; sq++) {</div>
<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;        <span class="keywordtype">int</span> d0 = sq * dsub;</div>
<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;</div>
<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;        {</div>
<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;            FINTEGER ki = k, di = d, m1 = M + 1;</div>
<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;            FINTEGER dsubi = dsub;</div>
<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;            <span class="keywordtype">float</span> zero = 0, one = 1;</div>
<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;</div>
<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;            sgemm_ (<span class="stringliteral">&quot;N&quot;</span>, <span class="stringliteral">&quot;N&quot;</span>, &amp;dsubi, &amp;ki, &amp;m1, &amp;one,</div>
<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;                    tmp1 + d0, &amp;di,</div>
<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;                    codebook.data() + sq * (m1 * k), &amp;m1,</div>
<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;                    &amp;zero, tmp2, &amp;dsubi);</div>
<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;        }</div>
<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;</div>
<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;        <span class="keywordtype">float</span> min = HUGE_VAL;</div>
<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;        <span class="keywordtype">int</span> argmin = -1;</div>
<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; k; j++) {</div>
<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;            <span class="keywordtype">float</span> dis = <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(x + d0, tmp2 + j * dsub, dsub);</div>
<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;            <span class="keywordflow">if</span> (dis &lt; min) {</div>
<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;                min = dis;</div>
<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;                argmin = j;</div>
<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;            }</div>
<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;        }</div>
<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;        code[sq] = argmin;</div>
<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;    }</div>
<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;</div>
<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;}</div>
<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;</div>
<div class="line"><a name="l00842"></a><span class="lineno"><a class="line" href="structfaiss_1_1ReconstructFromNeighbors.html#a454b7a5f7437a257df7404f5778fc833">  842</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a454b7a5f7437a257df7404f5778fc833">ReconstructFromNeighbors::add_codes</a>(<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x)</div>
<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;{</div>
<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;    <span class="keywordflow">if</span> (k == 1) { <span class="comment">// nothing to encode</span></div>
<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;        ntotal += n;</div>
<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;    }</div>
<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;    codes.resize(codes.size() + code_size * n);</div>
<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;<span class="preprocessor">#pragma omp parallel for</span></div>
<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;<span class="preprocessor"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;        <a class="code" href="structfaiss_1_1ReconstructFromNeighbors.html#a88ca99742dccc52ebb3324b507b6c872">estimate_code</a>(x + i * index.d, ntotal + i,</div>
<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;                      codes.data() + (ntotal + i) * code_size);</div>
<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;    }</div>
<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;    ntotal += n;</div>
<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;    FAISS_ASSERT (codes.size() == ntotal * code_size);</div>
<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;}</div>
<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;</div>
<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;</div>
<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;<span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;<span class="comment"> * IndexHNSWFlat implementation</span></div>
<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;<span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;</div>
<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;</div>
<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;</div>
<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;</div>
<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;<span class="keyword">struct </span>FlatL2Dis: <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> {</div>
<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;    <span class="keywordtype">size_t</span> d;</div>
<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;    <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> nb;</div>
<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">float</span> *q;</div>
<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">float</span> *b;</div>
<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;    <span class="keywordtype">size_t</span> ndis;</div>
<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;</div>
<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;    <span class="keywordtype">float</span> operator () (idx_t i)<span class="keyword"> override</span></div>
<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;        ndis++;</div>
<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;        <span class="keywordflow">return</span> (<a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(q, b + i * d, d));</div>
<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;    }</div>
<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;</div>
<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;    <span class="keywordtype">float</span> symmetric_dis(idx_t i, idx_t j)<span class="keyword"> override</span></div>
<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;        <span class="keywordflow">return</span> (<a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(b + j * d, b + i * d, d));</div>
<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;    }</div>
<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;</div>
<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;</div>
<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;    FlatL2Dis(<span class="keyword">const</span> IndexFlatL2 &amp; storage, <span class="keyword">const</span> <span class="keywordtype">float</span> *q = <span class="keyword">nullptr</span>):</div>
<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;        q(q)</div>
<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;    {</div>
<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;        nb = storage.ntotal;</div>
<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;        d = storage.d;</div>
<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;        b = storage.xb.data();</div>
<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;        ndis = 0;</div>
<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;    }</div>
<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;</div>
<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;    <span class="keywordtype">void</span> set_query(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;        q = x;</div>
<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;    }</div>
<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;</div>
<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;    ~FlatL2Dis()<span class="keyword"> override </span>{</div>
<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;<span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;<span class="preprocessor"></span>        {</div>
<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;            hnsw_stats.ndis += ndis;</div>
<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;        }</div>
<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;    }</div>
<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;};</div>
<div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;</div>
<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;</div>
<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;}  <span class="comment">// namespace</span></div>
<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;</div>
<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;</div>
<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;IndexHNSWFlat::IndexHNSWFlat()</div>
<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;{</div>
<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;    <a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a> = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;}</div>
<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;</div>
<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;</div>
<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;IndexHNSWFlat::IndexHNSWFlat(<span class="keywordtype">int</span> d, <span class="keywordtype">int</span> M):</div>
<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;    IndexHNSW(new IndexFlatL2(d), M)</div>
<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;{</div>
<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;    own_fields = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;    is_trained = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;}</div>
<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;</div>
<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;</div>
<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;DistanceComputer * IndexHNSWFlat::get_distance_computer ()<span class="keyword"> const</span></div>
<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">new</span> FlatL2Dis (*dynamic_cast&lt;IndexFlatL2*&gt; (storage));</div>
<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;}</div>
<div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160;</div>
<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;</div>
<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;</div>
<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;</div>
<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;<span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;<span class="comment"> * IndexHNSWPQ implementation</span></div>
<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;<span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;</div>
<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;</div>
<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;</div>
<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;</div>
<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;<span class="keyword">struct </span>PQDis: DistanceComputer {</div>
<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;    <span class="keywordtype">size_t</span> d;</div>
<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;    <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> nb;</div>
<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;    <span class="keyword">const</span> uint8_t *codes;</div>
<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;    <span class="keywordtype">size_t</span> code_size;</div>
<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;    <span class="keyword">const</span> ProductQuantizer &amp; pq;</div>
<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">float</span> *sdc;</div>
<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;    std::vector&lt;float&gt; precomputed_table;</div>
<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;    <span class="keywordtype">size_t</span> ndis;</div>
<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;</div>
<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;    <span class="keywordtype">float</span> operator () (idx_t i)<span class="keyword"> override</span></div>
<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;        <span class="keyword">const</span> uint8_t *code = codes + i * code_size;</div>
<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">float</span> *dt = precomputed_table.data();</div>
<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;        <span class="keywordtype">float</span> accu = 0;</div>
<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; pq.M; j++) {</div>
<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;            accu += dt[*code++];</div>
<div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160;            dt += 256;</div>
<div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;        }</div>
<div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;        ndis++;</div>
<div class="line"><a name="l00961"></a><span class="lineno">  961</span>&#160;        <span class="keywordflow">return</span> accu;</div>
<div class="line"><a name="l00962"></a><span class="lineno">  962</span>&#160;    }</div>
<div class="line"><a name="l00963"></a><span class="lineno">  963</span>&#160;</div>
<div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;    <span class="keywordtype">float</span> symmetric_dis(idx_t i, idx_t j)<span class="keyword"> override</span></div>
<div class="line"><a name="l00965"></a><span class="lineno">  965</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">float</span> * sdci = sdc;</div>
<div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;        <span class="keywordtype">float</span> accu = 0;</div>
<div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;        <span class="keyword">const</span> uint8_t *codei = codes + i * code_size;</div>
<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;        <span class="keyword">const</span> uint8_t *codej = codes + j * code_size;</div>
<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;</div>
<div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l = 0; l &lt; pq.M; l++) {</div>
<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;            accu += sdci[(*codei++) + (*codej++) * 256];</div>
<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;            sdci += 256 * 256;</div>
<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;        }</div>
<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;        <span class="keywordflow">return</span> accu;</div>
<div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;    }</div>
<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;</div>
<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;    PQDis(<span class="keyword">const</span> IndexPQ&amp; storage, <span class="keyword">const</span> <span class="keywordtype">float</span>* <span class="comment">/*q*/</span> = <span class="keyword">nullptr</span>)</div>
<div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;        : pq(storage.pq) {</div>
<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;      precomputed_table.resize(pq.M * pq.ksub);</div>
<div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;      nb = storage.ntotal;</div>
<div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;      d = storage.d;</div>
<div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;      codes = storage.codes.data();</div>
<div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;      code_size = pq.code_size;</div>
<div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160;      FAISS_ASSERT(pq.ksub == 256);</div>
<div class="line"><a name="l00986"></a><span class="lineno">  986</span>&#160;      FAISS_ASSERT(pq.sdc_table.size() == pq.ksub * pq.ksub * pq.M);</div>
<div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;      sdc = pq.sdc_table.data();</div>
<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;      ndis = 0;</div>
<div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;    }</div>
<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;</div>
<div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;    <span class="keywordtype">void</span> set_query(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;        pq.compute_distance_table(x, precomputed_table.data());</div>
<div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;    }</div>
<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;</div>
<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;    ~PQDis()<span class="keyword"> override </span>{</div>
<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;<span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;<span class="preprocessor"></span>        {</div>
<div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;            hnsw_stats.ndis += ndis;</div>
<div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;        }</div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;    }</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;};</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;</div>
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;}  <span class="comment">// namespace</span></div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;</div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;</div>
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;IndexHNSWPQ::IndexHNSWPQ() {}</div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;</div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;IndexHNSWPQ::IndexHNSWPQ(<span class="keywordtype">int</span> d, <span class="keywordtype">int</span> pq_m, <span class="keywordtype">int</span> M):</div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;    IndexHNSW(new IndexPQ(d, pq_m, 8), M)</div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;{</div>
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;    own_fields = <span class="keyword">true</span>;</div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;    is_trained = <span class="keyword">false</span>;</div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;}</div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;</div>
<div class="line"><a name="l01016"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSWPQ.html#ae99b976eeb25717d10055b1786aa011c"> 1016</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSWPQ.html#ae99b976eeb25717d10055b1786aa011c">IndexHNSWPQ::train</a>(<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> n, <span class="keyword">const</span> <span class="keywordtype">float</span>* x)</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;{</div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;    <a class="code" href="structfaiss_1_1IndexHNSW.html#a40bc6d2c67545f95e322c63d68a47140">IndexHNSW::train</a> (n, x);</div>
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;    (<span class="keyword">dynamic_cast&lt;</span><a class="code" href="structfaiss_1_1IndexPQ.html">IndexPQ</a>*<span class="keyword">&gt;</span> (storage))-&gt;pq.compute_sdc_table();</div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;}</div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;</div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;<a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> * IndexHNSWPQ::get_distance_computer ()<span class="keyword"> const</span></div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">new</span> PQDis (*dynamic_cast&lt;IndexPQ*&gt; (storage));</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;}</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;<span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;<span class="comment"> * IndexHNSWSQ implementation</span></div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;<span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;</div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;IndexHNSWSQ::IndexHNSWSQ(<span class="keywordtype">int</span> d, <a class="code" href="structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e">ScalarQuantizer::QuantizerType</a> qtype, <span class="keywordtype">int</span> M):</div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;    IndexHNSW (new IndexScalarQuantizer (d, qtype), M)</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;{</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;    <a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a> = <span class="keyword">false</span>;</div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;    own_fields = <span class="keyword">true</span>;</div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;}</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;IndexHNSWSQ::IndexHNSWSQ() {}</div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;DistanceComputer * IndexHNSWSQ::get_distance_computer ()<span class="keyword"> const</span></div>
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;    <span class="keywordflow">return</span> (dynamic_cast&lt;const IndexScalarQuantizer*&gt; (storage))-&gt;</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;        get_distance_computer ();</div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;}</div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;</div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;</div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;<span class="comment">/**************************************************************</span></div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;<span class="comment"> * IndexHNSW2Level implementation</span></div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;<span class="comment"> **************************************************************/</span></div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;</div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;</div>
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;</div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;IndexHNSW2Level::IndexHNSW2Level(Index *quantizer, <span class="keywordtype">size_t</span> nlist, <span class="keywordtype">int</span> m_pq, <span class="keywordtype">int</span> M):</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;    IndexHNSW (new Index2Layer (quantizer, nlist, m_pq), M)</div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;{</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;    own_fields = <span class="keyword">true</span>;</div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;    <a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a> = <span class="keyword">false</span>;</div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;}</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;</div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;IndexHNSW2Level::IndexHNSW2Level() {}</div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;</div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;</div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;</div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;<span class="keyword">struct </span>Distance2Level: DistanceComputer {</div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;    <span class="keywordtype">size_t</span> d;</div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;    <span class="keyword">const</span> Index2Layer &amp; storage;</div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;    std::vector&lt;float&gt; buf;</div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">float</span> *q;</div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160;</div>
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">float</span> *pq_l1_tab, *pq_l2_tab;</div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;</div>
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160;    Distance2Level(<span class="keyword">const</span> Index2Layer &amp; storage): storage(storage)</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;    {</div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160;        d = storage.d;</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;        FAISS_ASSERT(storage.pq.dsub == 4);</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>&#160;        pq_l2_tab = storage.pq.centroids.data();</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160;        buf.resize(2 * d);</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>&#160;    }</div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160;</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160;    <span class="keywordtype">float</span> symmetric_dis(idx_t i, idx_t j)<span class="keyword"> override</span></div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160;        storage.reconstruct(i, buf.data());</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160;        storage.reconstruct(j, buf.data() + d);</div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">fvec_L2sqr</a>(buf.data() + d, buf.data(), d);</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160;    }</div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;</div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160;    <span class="keywordtype">void</span> set_query(<span class="keyword">const</span> <span class="keywordtype">float</span> *x)<span class="keyword"> override </span>{</div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>&#160;        q = x;</div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160;    }</div>
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>&#160;};</div>
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>&#160;</div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160;</div>
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>&#160;<span class="comment">// well optimized for xNN+PQNN</span></div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160;<span class="keyword">struct </span>DistanceXPQ4: Distance2Level {</div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>&#160;</div>
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>&#160;    <span class="keywordtype">int</span> M, k;</div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;</div>
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160;    DistanceXPQ4(<span class="keyword">const</span> Index2Layer &amp; storage):</div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;        Distance2Level (storage)</div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160;    {</div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;        <span class="keyword">const</span> IndexFlat *quantizer =</div>
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;            <span class="keyword">dynamic_cast&lt;</span>IndexFlat*<span class="keyword">&gt;</span> (storage.q1.quantizer);</div>
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160;</div>
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160;        FAISS_ASSERT(quantizer);</div>
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;        M = storage.pq.M;</div>
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160;        pq_l1_tab = quantizer-&gt;xb.data();</div>
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160;    }</div>
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;</div>
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;    <span class="keywordtype">float</span> operator () (idx_t i)<span class="keyword"> override</span></div>
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160;<span class="preprocessor">#ifdef __SSE__</span></div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;<span class="preprocessor"></span>        <span class="keyword">const</span> uint8_t *code = storage.codes.data() + i * storage.code_size;</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;        <span class="keywordtype">long</span> key = 0;</div>
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160;        memcpy (&amp;key, code, storage.code_size_1);</div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;        code += storage.code_size_1;</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;</div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;        <span class="comment">// walking pointers</span></div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">float</span> *qa = q;</div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;        <span class="keyword">const</span> __m128 *l1_t = (<span class="keyword">const</span> __m128 *)(pq_l1_tab + d * key);</div>
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;        <span class="keyword">const</span> __m128 *pq_l2_t = (<span class="keyword">const</span> __m128 *)pq_l2_tab;</div>
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;        __m128 accu = _mm_setzero_ps();</div>
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;</div>
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> m = 0; m &lt; M; m++) {</div>
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;            __m128 qi = _mm_loadu_ps(qa);</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;            __m128 recons = l1_t[m] + pq_l2_t[*code++];</div>
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160;            __m128 diff = qi - recons;</div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;            accu += diff * diff;</div>
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160;            pq_l2_t += 256;</div>
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;            qa += 4;</div>
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160;        }</div>
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;</div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;        accu = _mm_hadd_ps (accu, accu);</div>
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;        accu = _mm_hadd_ps (accu, accu);</div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;        <span class="keywordflow">return</span>  _mm_cvtss_f32 (accu);</div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;<span class="preprocessor">#else</span></div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;<span class="preprocessor"></span>        FAISS_THROW_MSG(<span class="stringliteral">&quot;not implemented for non-x64 platforms&quot;</span>);</div>
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>&#160;<span class="preprocessor"></span>    }</div>
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>&#160;</div>
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>&#160;};</div>
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>&#160;</div>
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>&#160;<span class="comment">// well optimized for 2xNN+PQNN</span></div>
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>&#160;<span class="keyword">struct </span>Distance2xXPQ4: Distance2Level {</div>
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>&#160;</div>
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>&#160;    <span class="keywordtype">int</span> M_2, mi_nbits;</div>
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>&#160;</div>
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>&#160;    Distance2xXPQ4(<span class="keyword">const</span> Index2Layer &amp; storage):</div>
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>&#160;        Distance2Level (storage)</div>
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>&#160;    {</div>
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>&#160;        <span class="keyword">const</span> MultiIndexQuantizer *mi =</div>
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>&#160;            <span class="keyword">dynamic_cast&lt;</span>MultiIndexQuantizer*<span class="keyword">&gt;</span> (storage.q1.quantizer);</div>
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>&#160;</div>
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>&#160;        FAISS_ASSERT(mi);</div>
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>&#160;        FAISS_ASSERT(storage.pq.M % 2 == 0);</div>
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>&#160;        M_2 = storage.pq.M / 2;</div>
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>&#160;        mi_nbits = mi-&gt;pq.nbits;</div>
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>&#160;        pq_l1_tab = mi-&gt;pq.centroids.data();</div>
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>&#160;    }</div>
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>&#160;</div>
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>&#160;    <span class="keywordtype">float</span> operator () (idx_t i)<span class="keyword"> override</span></div>
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>&#160;        <span class="keyword">const</span> uint8_t *code = storage.codes.data() + i * storage.code_size;</div>
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>&#160;        <span class="keywordtype">long</span> key01 = 0;</div>
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>&#160;        memcpy (&amp;key01, code, storage.code_size_1);</div>
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>&#160;        code += storage.code_size_1;</div>
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>&#160;<span class="preprocessor">#ifdef __SSE__</span></div>
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>&#160;        <span class="comment">// walking pointers</span></div>
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>&#160;        <span class="keyword">const</span> <span class="keywordtype">float</span> *qa = q;</div>
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>&#160;        <span class="keyword">const</span> __m128 *pq_l1_t = (<span class="keyword">const</span> __m128 *)pq_l1_tab;</div>
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>&#160;        <span class="keyword">const</span> __m128 *pq_l2_t = (<span class="keyword">const</span> __m128 *)pq_l2_tab;</div>
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>&#160;        __m128 accu = _mm_setzero_ps();</div>
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>&#160;</div>
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> mi_m = 0; mi_m &lt; 2; mi_m++) {</div>
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>&#160;            <span class="keywordtype">long</span> l1_idx = key01 &amp; ((1L &lt;&lt; mi_nbits) - 1);</div>
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>&#160;            <span class="keyword">const</span> __m128 * pq_l1 = pq_l1_t + M_2 * l1_idx;</div>
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>&#160;</div>
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> m = 0; m &lt; M_2; m++) {</div>
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>&#160;                __m128 qi = _mm_loadu_ps(qa);</div>
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>&#160;                __m128 recons = pq_l1[m] + pq_l2_t[*code++];</div>
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>&#160;                __m128 diff = qi - recons;</div>
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>&#160;                accu += diff * diff;</div>
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>&#160;                pq_l2_t += 256;</div>
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>&#160;                qa += 4;</div>
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>&#160;            }</div>
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>&#160;            pq_l1_t += M_2 &lt;&lt; mi_nbits;</div>
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>&#160;            key01 &gt;&gt;= mi_nbits;</div>
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>&#160;        }</div>
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>&#160;        accu = _mm_hadd_ps (accu, accu);</div>
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>&#160;        accu = _mm_hadd_ps (accu, accu);</div>
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>&#160;        <span class="keywordflow">return</span>  _mm_cvtss_f32 (accu);</div>
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>&#160;<span class="preprocessor">#else</span></div>
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>&#160;<span class="preprocessor"></span>        FAISS_THROW_MSG(<span class="stringliteral">&quot;not implemented for non-x64 platforms&quot;</span>);</div>
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>&#160;<span class="preprocessor"></span>    }</div>
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>&#160;</div>
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>&#160;};</div>
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>&#160;</div>
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>&#160;</div>
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>&#160;}  <span class="comment">// namespace</span></div>
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>&#160;</div>
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>&#160;</div>
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>&#160;DistanceComputer * IndexHNSW2Level::get_distance_computer ()<span class="keyword"> const</span></div>
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>&#160;    <span class="keyword">const</span> Index2Layer *storage2l =</div>
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>&#160;        <span class="keyword">dynamic_cast&lt;</span>Index2Layer*<span class="keyword">&gt;</span>(storage);</div>
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>&#160;</div>
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>&#160;    <span class="keywordflow">if</span> (storage2l) {</div>
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>&#160;<span class="preprocessor">#ifdef __SSE__</span></div>
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>&#160;        <span class="keyword">const</span> MultiIndexQuantizer *mi =</div>
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>&#160;            <span class="keyword">dynamic_cast&lt;</span>MultiIndexQuantizer*<span class="keyword">&gt;</span> (storage2l-&gt;q1.quantizer);</div>
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>&#160;</div>
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>&#160;        <span class="keywordflow">if</span> (mi &amp;&amp; storage2l-&gt;pq.M % 2 == 0 &amp;&amp; storage2l-&gt;pq.dsub == 4) {</div>
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">new</span> Distance2xXPQ4(*storage2l);</div>
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>&#160;        }</div>
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>&#160;</div>
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>&#160;        <span class="keyword">const</span> IndexFlat *fl =</div>
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>&#160;            <span class="keyword">dynamic_cast&lt;</span>IndexFlat*<span class="keyword">&gt;</span> (storage2l-&gt;q1.quantizer);</div>
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>&#160;</div>
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>&#160;        <span class="keywordflow">if</span> (fl &amp;&amp; storage2l-&gt;pq.dsub == 4) {</div>
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">new</span> DistanceXPQ4(*storage2l);</div>
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>&#160;        }</div>
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>&#160;<span class="preprocessor"></span>    }</div>
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>&#160;</div>
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>&#160;    <span class="comment">// IVFPQ and cases not handled above</span></div>
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">new</span> GenericDistanceComputer (*storage);</div>
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>&#160;</div>
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>&#160;}</div>
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>&#160;</div>
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>&#160;</div>
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>&#160;</div>
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>&#160;</div>
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>&#160;<span class="comment">// same as search_from_candidates but uses v</span></div>
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>&#160;<span class="comment">// visno -&gt; is in result list</span></div>
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>&#160;<span class="comment">// visno + 1 -&gt; in result list + in candidates</span></div>
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>&#160;<span class="keywordtype">int</span> search_from_candidates_2(<span class="keyword">const</span> HNSW &amp; hnsw,</div>
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>&#160;                             DistanceComputer &amp; qdis, <span class="keywordtype">int</span> k,</div>
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>&#160;                             idx_t *I, <span class="keywordtype">float</span> * D,</div>
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>&#160;                             MinimaxHeap &amp;candidates,</div>
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>&#160;                             VisitedTable &amp;vt,</div>
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>&#160;                             <span class="keywordtype">int</span> level, <span class="keywordtype">int</span> nres_in = 0)</div>
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>&#160;{</div>
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>&#160;    <span class="keywordtype">int</span> nres = nres_in;</div>
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>&#160;    <span class="keywordtype">int</span> ndis = 0;</div>
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; candidates.size(); i++) {</div>
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>&#160;        idx_t v1 = candidates.ids[i];</div>
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>&#160;        FAISS_ASSERT(v1 &gt;= 0);</div>
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>&#160;        vt.visited[v1] = vt.visno + 1;</div>
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>&#160;    }</div>
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;</div>
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>&#160;    <span class="keywordtype">int</span> nstep = 0;</div>
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>&#160;</div>
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>&#160;    <span class="keywordflow">while</span> (candidates.size() &gt; 0) {</div>
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>&#160;        <span class="keywordtype">float</span> d0 = 0;</div>
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>&#160;        <span class="keywordtype">int</span> v0 = candidates.pop_min(&amp;d0);</div>
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>&#160;</div>
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>&#160;        <span class="keywordtype">size_t</span> begin, end;</div>
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>&#160;        hnsw.neighbor_range(v0, level, &amp;begin, &amp;end);</div>
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>&#160;</div>
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = begin; j &lt; end; j++) {</div>
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160;            <span class="keywordtype">int</span> v1 = hnsw.neighbors[j];</div>
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>&#160;            <span class="keywordflow">if</span> (v1 &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>&#160;            <span class="keywordflow">if</span> (vt.visited[v1] == vt.visno + 1) {</div>
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>&#160;                <span class="comment">// nothing to do</span></div>
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>&#160;            } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>&#160;                ndis++;</div>
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>&#160;                <span class="keywordtype">float</span> d = qdis(v1);</div>
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>&#160;                candidates.push(v1, d);</div>
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>&#160;</div>
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>&#160;                <span class="comment">// never seen before --&gt; add to heap</span></div>
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>&#160;                <span class="keywordflow">if</span> (vt.visited[v1] &lt; vt.visno) {</div>
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>&#160;                    <span class="keywordflow">if</span> (nres &lt; k) {</div>
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>&#160;                        faiss::maxheap_push (++nres, D, I, d, v1);</div>
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>&#160;                    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d &lt; D[0]) {</div>
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>&#160;                        faiss::maxheap_pop (nres--, D, I);</div>
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>&#160;                        faiss::maxheap_push (++nres, D, I, d, v1);</div>
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>&#160;                    }</div>
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>&#160;                }</div>
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>&#160;                vt.visited[v1] = vt.visno + 1;</div>
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>&#160;            }</div>
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>&#160;        }</div>
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>&#160;</div>
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>&#160;        nstep++;</div>
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>&#160;        <span class="keywordflow">if</span> (nstep &gt; hnsw.efSearch) {</div>
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>&#160;            <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>&#160;        }</div>
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>&#160;    }</div>
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>&#160;</div>
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>&#160;    <span class="keywordflow">if</span> (level == 0) {</div>
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>&#160;<span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>&#160;<span class="preprocessor"></span>        {</div>
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>&#160;            hnsw_stats.n1 ++;</div>
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>&#160;            <span class="keywordflow">if</span> (candidates.size() == 0)</div>
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>&#160;                hnsw_stats.n2 ++;</div>
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>&#160;        }</div>
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>&#160;    }</div>
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>&#160;</div>
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>&#160;</div>
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>&#160;    <span class="keywordflow">return</span> nres;</div>
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>&#160;}</div>
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>&#160;</div>
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>&#160;</div>
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>&#160;}  <span class="comment">// namespace</span></div>
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>&#160;</div>
<div class="line"><a name="l01316"></a><span class="lineno"><a class="line" href="structfaiss_1_1IndexHNSW2Level.html#a50a087a17ce5a7a1fbcca0836959b4ec"> 1316</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1IndexHNSW2Level.html#a50a087a17ce5a7a1fbcca0836959b4ec">IndexHNSW2Level::search</a> (<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> n, <span class="keyword">const</span> <span class="keywordtype">float</span> *x, <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> k,</div>
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>&#160;                              <span class="keywordtype">float</span> *distances, <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> *labels)<span class="keyword"> const</span></div>
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>&#160;    <span class="keywordflow">if</span> (dynamic_cast&lt;const Index2Layer*&gt;(storage)) {</div>
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>&#160;        <a class="code" href="structfaiss_1_1IndexHNSW.html#ae0ddf6ab4a54239a25d6277e21e8548e">IndexHNSW::search</a> (n, x, k, distances, labels);</div>
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>&#160;</div>
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>&#160;    } <span class="keywordflow">else</span> { <span class="comment">// &quot;mixed&quot; search</span></div>
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>&#160;</div>
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>&#160;        <span class="keyword">const</span> <a class="code" href="structfaiss_1_1IndexIVFPQ.html">IndexIVFPQ</a> *index_ivfpq =</div>
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>&#160;            <span class="keyword">dynamic_cast&lt;</span><span class="keyword">const </span><a class="code" href="structfaiss_1_1IndexIVFPQ.html">IndexIVFPQ</a>*<span class="keyword">&gt;</span>(storage);</div>
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>&#160;</div>
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>&#160;        <span class="keywordtype">int</span> nprobe = index_ivfpq-&gt;<a class="code" href="structfaiss_1_1IndexIVF.html#affed235eadf27a13d753ee4d33a1dc58">nprobe</a>;</div>
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>&#160;</div>
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>&#160;        <span class="keywordtype">long</span> * coarse_assign = <span class="keyword">new</span> <span class="keywordtype">long</span> [n * nprobe];</div>
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>&#160;        <a class="code" href="structfaiss_1_1ScopeDeleter.html">ScopeDeleter&lt;long&gt;</a> del (coarse_assign);</div>
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>&#160;        <span class="keywordtype">float</span> * coarse_dis = <span class="keyword">new</span> <span class="keywordtype">float</span> [n * nprobe];</div>
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>&#160;        <a class="code" href="structfaiss_1_1ScopeDeleter.html">ScopeDeleter&lt;float&gt;</a> del2 (coarse_dis);</div>
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>&#160;</div>
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>&#160;        index_ivfpq-&gt;<a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>-&gt;<a class="code" href="structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7">search</a> (n, x, nprobe, coarse_dis, coarse_assign);</div>
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>&#160;</div>
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>&#160;        index_ivfpq-&gt;<a class="code" href="structfaiss_1_1IndexIVF.html#a7cf3a1963394f87d61913420a66eb468">search_preassigned</a> (</div>
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>&#160;            n, x, k, coarse_assign, coarse_dis, distances, labels, <span class="keyword">false</span>);</div>
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>&#160;</div>
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>&#160;<span class="preprocessor">#pragma omp parallel</span></div>
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>&#160;<span class="preprocessor"></span>        {</div>
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>&#160;            <a class="code" href="structfaiss_1_1VisitedTable.html">VisitedTable</a> vt (ntotal);</div>
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>&#160;            <a class="code" href="structfaiss_1_1DistanceComputer.html">DistanceComputer</a> *dis = get_distance_computer();</div>
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>&#160;            <a class="code" href="structfaiss_1_1ScopeDeleter1.html">ScopeDeleter1&lt;DistanceComputer&gt;</a> del(dis);</div>
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>&#160;</div>
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>&#160;            <span class="keywordtype">int</span> candidates_size = hnsw.upper_beam;</div>
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>&#160;            <a class="code" href="structfaiss_1_1HNSW_1_1MinimaxHeap.html">MinimaxHeap</a> candidates(candidates_size);</div>
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>&#160;</div>
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>&#160;<span class="preprocessor"></span>            <span class="keywordflow">for</span>(<a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>&#160;                <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> * idxi = labels + i * k;</div>
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>&#160;                <span class="keywordtype">float</span> * simi = distances + i * k;</div>
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>&#160;                dis-&gt;<a class="code" href="structfaiss_1_1DistanceComputer.html#aaa4472453365b786adc2ab21e9cee5ec">set_query</a>(x + i * d);</div>
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>&#160;</div>
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>&#160;                <span class="comment">// mark all inverted list elements as visited</span></div>
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>&#160;</div>
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>&#160;                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; nprobe; j++) {</div>
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>&#160;                    <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> key = coarse_assign[j + i * nprobe];</div>
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>&#160;                    <span class="keywordflow">if</span> (key &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>&#160;                    <span class="keywordtype">size_t</span> list_length = index_ivfpq-&gt;get_list_size (key);</div>
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>&#160;                    <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">idx_t</a> * ids = index_ivfpq-&gt;<a class="code" href="structfaiss_1_1IndexIVF.html#aa0e8fc5e04cbd8e0dde61f98bc7dd0bc">invlists</a>-&gt;<a class="code" href="structfaiss_1_1InvertedLists.html#a3ab6b389d8d85c5fbf23889064df7e95">get_ids</a> (key);</div>
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>&#160;</div>
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>&#160;                    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> jj = 0; jj &lt; list_length; jj++) {</div>
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>&#160;                        vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">set</a> (ids[jj]);</div>
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>&#160;                    }</div>
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>&#160;                }</div>
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>&#160;</div>
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>&#160;                candidates.clear();</div>
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>&#160;                <span class="comment">// copy the upper_beam elements to candidates list</span></div>
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>&#160;</div>
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>&#160;                <span class="keywordtype">int</span> search_policy = 2;</div>
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>&#160;</div>
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>&#160;                <span class="keywordflow">if</span> (search_policy == 1) {</div>
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>&#160;</div>
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>&#160;                    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0 ; j &lt; hnsw.upper_beam &amp;&amp; j &lt; k; j++) {</div>
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>&#160;                        <span class="keywordflow">if</span> (idxi[j] &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>&#160;                        candidates.push (idxi[j], simi[j]);</div>
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>&#160;                        <span class="comment">// search_from_candidates adds them back</span></div>
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>&#160;                        idxi[j] = -1;</div>
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>&#160;                        simi[j] = HUGE_VAL;</div>
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>&#160;                    }</div>
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>&#160;</div>
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>&#160;                    <span class="comment">// reorder from sorted to heap</span></div>
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>&#160;                    maxheap_heapify (k, simi, idxi, simi, idxi, k);</div>
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>&#160;</div>
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>&#160;                    hnsw.search_from_candidates(</div>
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>&#160;                      *dis, k, idxi, simi,</div>
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>&#160;                      candidates, vt, 0, k</div>
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>&#160;                    );</div>
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>&#160;</div>
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>&#160;                    vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a>();</div>
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>&#160;</div>
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>&#160;                } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (search_policy == 2) {</div>
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>&#160;</div>
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>&#160;                    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0 ; j &lt; hnsw.upper_beam &amp;&amp; j &lt; k; j++) {</div>
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>&#160;                        <span class="keywordflow">if</span> (idxi[j] &lt; 0) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>&#160;                        candidates.push (idxi[j], simi[j]);</div>
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>&#160;                    }</div>
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>&#160;</div>
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>&#160;                    <span class="comment">// reorder from sorted to heap</span></div>
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>&#160;                    maxheap_heapify (k, simi, idxi, simi, idxi, k);</div>
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>&#160;</div>
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>&#160;                    search_from_candidates_2 (</div>
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>&#160;                        hnsw, *dis, k, idxi, simi,</div>
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>&#160;                        candidates, vt, 0, k);</div>
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>&#160;                    vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a> ();</div>
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>&#160;                    vt.<a class="code" href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">advance</a> ();</div>
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>&#160;</div>
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>&#160;                }</div>
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>&#160;</div>
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>&#160;                maxheap_reorder (k, simi, idxi);</div>
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>&#160;            }</div>
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>&#160;        }</div>
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>&#160;    }</div>
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>&#160;</div>
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>&#160;</div>
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>&#160;}</div>
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>&#160;</div>
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>&#160;</div>
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>&#160;<span class="keywordtype">void</span> IndexHNSW2Level::flip_to_ivf ()</div>
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>&#160;{</div>
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>&#160;    <a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a> *storage2l =</div>
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>&#160;        <span class="keyword">dynamic_cast&lt;</span><a class="code" href="structfaiss_1_1Index2Layer.html">Index2Layer</a>*<span class="keyword">&gt;</span>(storage);</div>
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>&#160;</div>
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>&#160;    FAISS_THROW_IF_NOT (storage2l);</div>
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>&#160;</div>
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>&#160;    <a class="code" href="structfaiss_1_1IndexIVFPQ.html">IndexIVFPQ</a> * index_ivfpq =</div>
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>&#160;        <span class="keyword">new</span> <a class="code" href="structfaiss_1_1IndexIVFPQ.html">IndexIVFPQ</a> (storage2l-&gt;<a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">quantizer</a>,</div>
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>&#160;                        d, storage2l-&gt;<a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#a1c4fc9d874d9492ee0ea27a5be388fa7">nlist</a>,</div>
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>&#160;                        storage2l-&gt;<a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>.<a class="code" href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">M</a>, 8);</div>
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>&#160;    index_ivfpq-&gt;<a class="code" href="structfaiss_1_1IndexIVFPQ.html#a007303be116c8da65b6d058e3fc77d16">pq</a> = storage2l-&gt;<a class="code" href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">pq</a>;</div>
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>&#160;    index_ivfpq-&gt;<a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a> = storage2l-&gt;<a class="code" href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">is_trained</a>;</div>
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>&#160;    index_ivfpq-&gt;<a class="code" href="structfaiss_1_1IndexIVFPQ.html#ad99c215aeaf92e995cb97f4044c4d267">precompute_table</a>();</div>
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>&#160;    index_ivfpq-&gt;<a class="code" href="structfaiss_1_1Level1Quantizer.html#ab688c629cd42122d73517078b87f483d">own_fields</a> = storage2l-&gt;<a class="code" href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">q1</a>.<a class="code" href="structfaiss_1_1Level1Quantizer.html#ab688c629cd42122d73517078b87f483d">own_fields</a>;</div>
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>&#160;    storage2l-&gt;<a class="code" href="structfaiss_1_1Index2Layer.html#a8692273ff51ab7f34748c3d5b3295216">transfer_to_IVFPQ</a>(*index_ivfpq);</div>
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>&#160;    index_ivfpq-&gt;<a class="code" href="structfaiss_1_1IndexIVF.html#a1c11ce77f459e2ab3e5d9a4c2263ad89">make_direct_map</a> (<span class="keyword">true</span>);</div>
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>&#160;</div>
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>&#160;    storage = index_ivfpq;</div>
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>&#160;    <span class="keyword">delete</span> storage2l;</div>
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>&#160;</div>
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>&#160;}</div>
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>&#160;</div>
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>&#160;</div>
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>&#160;}  <span class="comment">// namespace faiss</span></div>
<div class="ttc" id="structfaiss_1_1IndexIVFPQ_html_ad99c215aeaf92e995cb97f4044c4d267"><div class="ttname"><a href="structfaiss_1_1IndexIVFPQ.html#ad99c215aeaf92e995cb97f4044c4d267">faiss::IndexIVFPQ::precompute_table</a></div><div class="ttdeci">void precompute_table()</div><div class="ttdoc">build precomputed table </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8cpp_source.html#l00363">IndexIVFPQ.cpp:363</a></div></div>
<div class="ttc" id="structfaiss_1_1Index2Layer_html_a8692273ff51ab7f34748c3d5b3295216"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#a8692273ff51ab7f34748c3d5b3295216">faiss::Index2Layer::transfer_to_IVFPQ</a></div><div class="ttdeci">void transfer_to_IVFPQ(IndexIVFPQ &amp;other) const </div><div class="ttdoc">transfer the flat codes to an IVFPQ index </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8cpp_source.html#l01518">IndexIVFPQ.cpp:1518</a></div></div>
<div class="ttc" id="structfaiss_1_1DistanceComputer_html_a4b7236a757c788401aac00598ed902c7"><div class="ttname"><a href="structfaiss_1_1DistanceComputer.html#a4b7236a757c788401aac00598ed902c7">faiss::DistanceComputer::symmetric_dis</a></div><div class="ttdeci">virtual float symmetric_dis(idx_t i, idx_t j)=0</div><div class="ttdoc">compute distance between two stored vectors </div></div>
<div class="ttc" id="structfaiss_1_1ScalarQuantizer_html_a1201dbd1611fa5c10782ade5d0e4952e"><div class="ttname"><a href="structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e">faiss::ScalarQuantizer::QuantizerType</a></div><div class="ttdeci">QuantizerType</div><div class="ttdef"><b>Definition:</b> <a href="IndexScalarQuantizer_8h_source.html#l00034">IndexScalarQuantizer.h:34</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_aa3ae6a80d358e59e3af23f918253f61d"><div class="ttname"><a href="structfaiss_1_1HNSW.html#aa3ae6a80d358e59e3af23f918253f61d">faiss::HNSW::neighbor_range</a></div><div class="ttdeci">void neighbor_range(idx_t no, int layer_no, size_t *begin, size_t *end) const </div><div class="ttdoc">range of entries in the neighbors table of vertex no at layer_no </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8cpp_source.html#l00041">HNSW.cpp:41</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexIVF_html_a7cf3a1963394f87d61913420a66eb468"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#a7cf3a1963394f87d61913420a66eb468">faiss::IndexIVF::search_preassigned</a></div><div class="ttdeci">virtual void search_preassigned(idx_t n, const float *x, idx_t k, const idx_t *assign, const float *centroid_dis, float *distances, idx_t *labels, bool store_pairs, const IVFSearchParameters *params=nullptr) const </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8cpp_source.html#l00250">IndexIVF.cpp:250</a></div></div>
<div class="ttc" id="structfaiss_1_1DistanceComputer_html_aaa4472453365b786adc2ab21e9cee5ec"><div class="ttname"><a href="structfaiss_1_1DistanceComputer.html#aaa4472453365b786adc2ab21e9cee5ec">faiss::DistanceComputer::set_query</a></div><div class="ttdeci">virtual void set_query(const float *x)=0</div><div class="ttdoc">called before computing distances </div></div>
<div class="ttc" id="structfaiss_1_1VisitedTable_html_a18a972137362ff04a38943d66fc19dcb"><div class="ttname"><a href="structfaiss_1_1VisitedTable.html#a18a972137362ff04a38943d66fc19dcb">faiss::VisitedTable::get</a></div><div class="ttdeci">bool get(int no) const </div><div class="ttdoc">get flag #no </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00236">HNSW.h:236</a></div></div>
<div class="ttc" id="namespacefaiss_html_a7466bd32de31640860393a701eaac5ad"><div class="ttname"><a href="namespacefaiss.html#a7466bd32de31640860393a701eaac5ad">faiss::fvec_L2sqr</a></div><div class="ttdeci">float fvec_L2sqr(const float *x, const float *y, size_t d)</div><div class="ttdoc">Squared L2 distance between two vectors. </div><div class="ttdef"><b>Definition:</b> <a href="utils__simd_8cpp_source.html#l00501">utils_simd.cpp:501</a></div></div>
<div class="ttc" id="structfaiss_1_1DistanceComputer_html"><div class="ttname"><a href="structfaiss_1_1DistanceComputer.html">faiss::DistanceComputer</a></div><div class="ttdef"><b>Definition:</b> <a href="AuxIndexStructures_8h_source.html#l00231">AuxIndexStructures.h:231</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSWPQ_html_ae99b976eeb25717d10055b1786aa011c"><div class="ttname"><a href="structfaiss_1_1IndexHNSWPQ.html#ae99b976eeb25717d10055b1786aa011c">faiss::IndexHNSWPQ::train</a></div><div class="ttdeci">void train(idx_t n, const float *x) override</div><div class="ttdoc">Trains the storage if needed. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01016">IndexHNSW.cpp:1016</a></div></div>
<div class="ttc" id="structfaiss_1_1InvertedLists_html_a3ab6b389d8d85c5fbf23889064df7e95"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#a3ab6b389d8d85c5fbf23889064df7e95">faiss::InvertedLists::get_ids</a></div><div class="ttdeci">virtual const idx_t * get_ids(size_t list_no) const =0</div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW2Level_html_a50a087a17ce5a7a1fbcca0836959b4ec"><div class="ttname"><a href="structfaiss_1_1IndexHNSW2Level.html#a50a087a17ce5a7a1fbcca0836959b4ec">faiss::IndexHNSW2Level::search</a></div><div class="ttdeci">void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override</div><div class="ttdoc">entry point for search </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l01316">IndexHNSW.cpp:1316</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_a849361f5f0ab0aba8d419c86f2594191"><div class="ttname"><a href="structfaiss_1_1Index.html#a849361f5f0ab0aba8d419c86f2594191">faiss::Index::reset</a></div><div class="ttdeci">virtual void reset()=0</div><div class="ttdoc">removes all elements from the database. </div></div>
<div class="ttc" id="structfaiss_1_1IndexPQ_html"><div class="ttname"><a href="structfaiss_1_1IndexPQ.html">faiss::IndexPQ</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexPQ_8h_source.html#l00026">IndexPQ.h:26</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexIVF_html_affed235eadf27a13d753ee4d33a1dc58"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#affed235eadf27a13d753ee4d33a1dc58">faiss::IndexIVF::nprobe</a></div><div class="ttdeci">size_t nprobe</div><div class="ttdoc">number of probes at query time </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00097">IndexIVF.h:97</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_abf601502bdbfa02b9d7bcd7b3671b71d"><div class="ttname"><a href="structfaiss_1_1Index.html#abf601502bdbfa02b9d7bcd7b3671b71d">faiss::Index::train</a></div><div class="ttdeci">virtual void train(idx_t n, const float *x)</div><div class="ttdef"><b>Definition:</b> <a href="Index_8cpp_source.html#l00023">Index.cpp:23</a></div></div>
<div class="ttc" id="structfaiss_1_1ScopeDeleter1_html"><div class="ttname"><a href="structfaiss_1_1ScopeDeleter1.html">faiss::ScopeDeleter1</a></div><div class="ttdef"><b>Definition:</b> <a href="FaissException_8h_source.html#l00058">FaissException.h:58</a></div></div>
<div class="ttc" id="structfaiss_1_1ScopeDeleter_html"><div class="ttname"><a href="structfaiss_1_1ScopeDeleter.html">faiss::ScopeDeleter</a></div><div class="ttdef"><b>Definition:</b> <a href="FaissException_8h_source.html#l00045">FaissException.h:45</a></div></div>
<div class="ttc" id="structfaiss_1_1Index2Layer_html_a5f2d70740af90b8c7ac946d58ec947aa"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#a5f2d70740af90b8c7ac946d58ec947aa">faiss::Index2Layer::q1</a></div><div class="ttdeci">Level1Quantizer q1</div><div class="ttdoc">first level quantizer </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00206">IndexIVFPQ.h:206</a></div></div>
<div class="ttc" id="structfaiss_1_1VisitedTable_html_a76223893c8c3a577473092b3bb8a2446"><div class="ttname"><a href="structfaiss_1_1VisitedTable.html#a76223893c8c3a577473092b3bb8a2446">faiss::VisitedTable::advance</a></div><div class="ttdeci">void advance()</div><div class="ttdoc">reset all flags to false </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00241">HNSW.h:241</a></div></div>
<div class="ttc" id="structfaiss_1_1Index2Layer_html"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html">faiss::Index2Layer</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00204">IndexIVFPQ.h:204</a></div></div>
<div class="ttc" id="structfaiss_1_1InterruptCallback_html_a6b7b2569b2d3a88daea65b469a24e378"><div class="ttname"><a href="structfaiss_1_1InterruptCallback.html#a6b7b2569b2d3a88daea65b469a24e378">faiss::InterruptCallback::check</a></div><div class="ttdeci">static void check()</div><div class="ttdef"><b>Definition:</b> <a href="AuxIndexStructures_8cpp_source.html#l00307">AuxIndexStructures.cpp:307</a></div></div>
<div class="ttc" id="structfaiss_1_1ReconstructFromNeighbors_html_aed256bdd9f48dc93cb9e33cfdfd5bde7"><div class="ttname"><a href="structfaiss_1_1ReconstructFromNeighbors.html#aed256bdd9f48dc93cb9e33cfdfd5bde7">faiss::ReconstructFromNeighbors::get_neighbor_table</a></div><div class="ttdeci">void get_neighbor_table(storage_idx_t i, float *out) const </div><div class="ttdoc">get the M+1 -by-d table for neighbor coordinates for vector i </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00783">IndexHNSW.cpp:783</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a40bc6d2c67545f95e322c63d68a47140"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a40bc6d2c67545f95e322c63d68a47140">faiss::IndexHNSW::train</a></div><div class="ttdeci">void train(idx_t n, const float *x) override</div><div class="ttdoc">Trains the storage if needed. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00236">IndexHNSW.cpp:236</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_a2a002388d2c081c2dbab8508dcefe73d"><div class="ttname"><a href="structfaiss_1_1Index.html#a2a002388d2c081c2dbab8508dcefe73d">faiss::Index::d</a></div><div class="ttdeci">int d</div><div class="ttdoc">vector dimension </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00066">Index.h:66</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_ad3f0d3071f987baabbdd3da4500c87ea"><div class="ttname"><a href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">faiss::Index::idx_t</a></div><div class="ttdeci">long idx_t</div><div class="ttdoc">all indices are this type </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00062">Index.h:62</a></div></div>
<div class="ttc" id="structfaiss_1_1VisitedTable_html"><div class="ttname"><a href="structfaiss_1_1VisitedTable.html">faiss::VisitedTable</a></div><div class="ttdoc">set implementation optimized for fast access. </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00223">HNSW.h:223</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexIVFPQ_html"><div class="ttname"><a href="structfaiss_1_1IndexIVFPQ.html">faiss::IndexIVFPQ</a></div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00034">IndexIVFPQ.h:34</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a04a761ce17d0f9040b3bc8a77bd627d9"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a04a761ce17d0f9040b3bc8a77bd627d9">faiss::IndexHNSW::add</a></div><div class="ttdeci">void add(idx_t n, const float *x) override</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00294">IndexHNSW.cpp:294</a></div></div>
<div class="ttc" id="structfaiss_1_1ReconstructFromNeighbors_html_a6cf260c530e273e4d676804ac71128f8"><div class="ttname"><a href="structfaiss_1_1ReconstructFromNeighbors.html#a6cf260c530e273e4d676804ac71128f8">faiss::ReconstructFromNeighbors::reconstruct</a></div><div class="ttdeci">void reconstruct(storage_idx_t i, float *x, float *tmp) const </div><div class="ttdoc">called by compute_distances </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00648">IndexHNSW.cpp:648</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_a1b5e9ac70adbce0897dd6c8276ad96f2"><div class="ttname"><a href="structfaiss_1_1Index.html#a1b5e9ac70adbce0897dd6c8276ad96f2">faiss::Index::add</a></div><div class="ttdeci">virtual void add(idx_t n, const float *x)=0</div></div>
<div class="ttc" id="structfaiss_1_1Index_html_a6970683faa021b7a6f1a0865c0d4eccd"><div class="ttname"><a href="structfaiss_1_1Index.html#a6970683faa021b7a6f1a0865c0d4eccd">faiss::Index::ntotal</a></div><div class="ttdeci">idx_t ntotal</div><div class="ttdoc">total nb of indexed vectors </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00067">Index.h:67</a></div></div>
<div class="ttc" id="namespacefaiss_html_af2a71f7d5402ae02ce169a4cc83020eb"><div class="ttname"><a href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">faiss::getmillisecs</a></div><div class="ttdeci">double getmillisecs()</div><div class="ttdoc">ms elapsed since some arbitrary epoch </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00069">utils.cpp:69</a></div></div>
<div class="ttc" id="structfaiss_1_1ReconstructFromNeighbors_html_a88ca99742dccc52ebb3324b507b6c872"><div class="ttname"><a href="structfaiss_1_1ReconstructFromNeighbors.html#a88ca99742dccc52ebb3324b507b6c872">faiss::ReconstructFromNeighbors::estimate_code</a></div><div class="ttdeci">void estimate_code(const float *x, storage_idx_t i, uint8_t *code) const </div><div class="ttdoc">called by add_codes </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00802">IndexHNSW.cpp:802</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_aced51b1ebc33c47ab3ae15ea906559a7"><div class="ttname"><a href="structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7">faiss::Index::search</a></div><div class="ttdeci">virtual void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const =0</div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html"><div class="ttname"><a href="structfaiss_1_1HNSW.html">faiss::HNSW</a></div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00046">HNSW.h:46</a></div></div>
<div class="ttc" id="structfaiss_1_1InterruptCallback_html_adb241fbde51ecd1003cefb8295cd1e0d"><div class="ttname"><a href="structfaiss_1_1InterruptCallback.html#adb241fbde51ecd1003cefb8295cd1e0d">faiss::InterruptCallback::is_interrupted</a></div><div class="ttdeci">static bool is_interrupted()</div><div class="ttdef"><b>Definition:</b> <a href="AuxIndexStructures_8cpp_source.html#l00316">AuxIndexStructures.cpp:316</a></div></div>
<div class="ttc" id="structfaiss_1_1ReconstructFromNeighbors_html_a454b7a5f7437a257df7404f5778fc833"><div class="ttname"><a href="structfaiss_1_1ReconstructFromNeighbors.html#a454b7a5f7437a257df7404f5778fc833">faiss::ReconstructFromNeighbors::add_codes</a></div><div class="ttdeci">void add_codes(size_t n, const float *x)</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00842">IndexHNSW.cpp:842</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexIVF_html_a1c11ce77f459e2ab3e5d9a4c2263ad89"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#a1c11ce77f459e2ab3e5d9a4c2263ad89">faiss::IndexIVF::make_direct_map</a></div><div class="ttdeci">void make_direct_map(bool new_maintain_direct_map=true)</div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8cpp_source.html#l00202">IndexIVF.cpp:202</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexIVFPQ_html_a007303be116c8da65b6d058e3fc77d16"><div class="ttname"><a href="structfaiss_1_1IndexIVFPQ.html#a007303be116c8da65b6d058e3fc77d16">faiss::IndexIVFPQ::pq</a></div><div class="ttdeci">ProductQuantizer pq</div><div class="ttdoc">produces the codes </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00037">IndexIVFPQ.h:37</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexIVF_html_aa0e8fc5e04cbd8e0dde61f98bc7dd0bc"><div class="ttname"><a href="structfaiss_1_1IndexIVF.html#aa0e8fc5e04cbd8e0dde61f98bc7dd0bc">faiss::IndexIVF::invlists</a></div><div class="ttdeci">InvertedLists * invlists</div><div class="ttdoc">Acess to the actual data. </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00092">IndexIVF.h:92</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_ad4b9f97d42e2521e01f8b60012985396"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#ad4b9f97d42e2521e01f8b60012985396">faiss::IndexHNSW::reset</a></div><div class="ttdeci">void reset() override</div><div class="ttdoc">removes all elements from the database. </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00305">IndexHNSW.cpp:305</a></div></div>
<div class="ttc" id="structfaiss_1_1ProductQuantizer_html_a83600e328893ce5f41fe459f5a3acf41"><div class="ttname"><a href="structfaiss_1_1ProductQuantizer.html#a83600e328893ce5f41fe459f5a3acf41">faiss::ProductQuantizer::M</a></div><div class="ttdeci">size_t M</div><div class="ttdoc">number of subquantizers </div><div class="ttdef"><b>Definition:</b> <a href="ProductQuantizer_8h_source.html#l00028">ProductQuantizer.h:28</a></div></div>
<div class="ttc" id="structfaiss_1_1InterruptCallback_html_a1e4134a6b41f93d2405e030527573728"><div class="ttname"><a href="structfaiss_1_1InterruptCallback.html#a1e4134a6b41f93d2405e030527573728">faiss::InterruptCallback::get_period_hint</a></div><div class="ttdeci">static size_t get_period_hint(size_t flops)</div><div class="ttdef"><b>Definition:</b> <a href="AuxIndexStructures_8cpp_source.html#l00324">AuxIndexStructures.cpp:324</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_ab9c75063090927f8f65d1896b6949af4"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#ab9c75063090927f8f65d1896b6949af4">faiss::IndexHNSW::init_level_0_from_entry_points</a></div><div class="ttdeci">void init_level_0_from_entry_points(int npt, const storage_idx_t *points, const storage_idx_t *nearests)</div><div class="ttdoc">alternative graph building </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00465">IndexHNSW.cpp:465</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_ae0ddf6ab4a54239a25d6277e21e8548e"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#ae0ddf6ab4a54239a25d6277e21e8548e">faiss::IndexHNSW::search</a></div><div class="ttdeci">void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override</div><div class="ttdoc">entry point for search </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00243">IndexHNSW.cpp:243</a></div></div>
<div class="ttc" id="structfaiss_1_1Level1Quantizer_html_a3cf99e2ee92b8558a066f821efab95d5"><div class="ttname"><a href="structfaiss_1_1Level1Quantizer.html#a3cf99e2ee92b8558a066f821efab95d5">faiss::Level1Quantizer::quantizer</a></div><div class="ttdeci">Index * quantizer</div><div class="ttdoc">quantizer that maps vectors to inverted lists </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00032">IndexIVF.h:32</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a9a86c58212f3f9cf88394f5297cba525"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a9a86c58212f3f9cf88394f5297cba525">faiss::IndexHNSW::init_level_0_from_knngraph</a></div><div class="ttdeci">void init_level_0_from_knngraph(int k, const float *D, const idx_t *I)</div><div class="ttdoc">alternative graph building </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00427">IndexHNSW.cpp:427</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a5b619a41ddd52f0377efb701829c1e43"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a5b619a41ddd52f0377efb701829c1e43">faiss::IndexHNSW::search_level_0</a></div><div class="ttdeci">void search_level_0(idx_t n, const float *x, idx_t k, const storage_idx_t *nearest, const float *nearest_d, float *distances, idx_t *labels, int nprobe=1, int search_type=1) const </div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00355">IndexHNSW.cpp:355</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_1_1MinimaxHeap_html"><div class="ttname"><a href="structfaiss_1_1HNSW_1_1MinimaxHeap.html">faiss::HNSW::MinimaxHeap</a></div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00057">HNSW.h:57</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_a6e92732617c4dbe364e7678dd8773a7f"><div class="ttname"><a href="structfaiss_1_1Index.html#a6e92732617c4dbe364e7678dd8773a7f">faiss::Index::is_trained</a></div><div class="ttdeci">bool is_trained</div><div class="ttdoc">set if the Index does not require training, or if training is done already </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00071">Index.h:71</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_a27bd11ef9a651a94bcefa5291336fc58"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a27bd11ef9a651a94bcefa5291336fc58">faiss::HNSW::neighbors</a></div><div class="ttdeci">std::vector&lt; storage_idx_t &gt; neighbors</div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00114">HNSW.h:114</a></div></div>
<div class="ttc" id="structfaiss_1_1IndexHNSW_html_a660e5c8de1ba9c71bf3fe1f3bf0c8812"><div class="ttname"><a href="structfaiss_1_1IndexHNSW.html#a660e5c8de1ba9c71bf3fe1f3bf0c8812">faiss::IndexHNSW::reconstruct</a></div><div class="ttdeci">void reconstruct(idx_t key, float *recons) const override</div><div class="ttdef"><b>Definition:</b> <a href="IndexHNSW_8cpp_source.html#l00312">IndexHNSW.cpp:312</a></div></div>
<div class="ttc" id="structfaiss_1_1Index_html_aaef6f4132b1f390121ebb11058baf190"><div class="ttname"><a href="structfaiss_1_1Index.html#aaef6f4132b1f390121ebb11058baf190">faiss::Index::reconstruct</a></div><div class="ttdeci">virtual void reconstruct(idx_t key, float *recons) const </div><div class="ttdef"><b>Definition:</b> <a href="Index_8cpp_source.html#l00054">Index.cpp:54</a></div></div>
<div class="ttc" id="structfaiss_1_1Index2Layer_html_ab90d1de73cbc705a347cfc852ded6006"><div class="ttname"><a href="structfaiss_1_1Index2Layer.html#ab90d1de73cbc705a347cfc852ded6006">faiss::Index2Layer::pq</a></div><div class="ttdeci">ProductQuantizer pq</div><div class="ttdoc">second level quantizer is always a PQ </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVFPQ_8h_source.html#l00209">IndexIVFPQ.h:209</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_ae1342fc2f07c325598a73b733e88ee74"><div class="ttname"><a href="structfaiss_1_1HNSW.html#ae1342fc2f07c325598a73b733e88ee74">faiss::HNSW::storage_idx_t</a></div><div class="ttdeci">int storage_idx_t</div><div class="ttdoc">internal storage of vectors (32 bits: this is expensive) </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00048">HNSW.h:48</a></div></div>
<div class="ttc" id="structfaiss_1_1Level1Quantizer_html_ab688c629cd42122d73517078b87f483d"><div class="ttname"><a href="structfaiss_1_1Level1Quantizer.html#ab688c629cd42122d73517078b87f483d">faiss::Level1Quantizer::own_fields</a></div><div class="ttdeci">bool own_fields</div><div class="ttdoc">whether object owns the quantizer </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00041">IndexIVF.h:41</a></div></div>
<div class="ttc" id="structfaiss_1_1VisitedTable_html_a387b6428f4bfa44495c70a5f1f45f853"><div class="ttname"><a href="structfaiss_1_1VisitedTable.html#a387b6428f4bfa44495c70a5f1f45f853">faiss::VisitedTable::set</a></div><div class="ttdeci">void set(int no)</div><div class="ttdoc">set flog #no to true </div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8h_source.html#l00231">HNSW.h:231</a></div></div>
<div class="ttc" id="structfaiss_1_1Level1Quantizer_html_a1c4fc9d874d9492ee0ea27a5be388fa7"><div class="ttname"><a href="structfaiss_1_1Level1Quantizer.html#a1c4fc9d874d9492ee0ea27a5be388fa7">faiss::Level1Quantizer::nlist</a></div><div class="ttdeci">size_t nlist</div><div class="ttdoc">number of possible key values </div><div class="ttdef"><b>Definition:</b> <a href="IndexIVF_8h_source.html#l00033">IndexIVF.h:33</a></div></div>
<div class="ttc" id="structfaiss_1_1HNSW_html_a0cf1870a859783925e95b15bf5e83584"><div class="ttname"><a href="structfaiss_1_1HNSW.html#a0cf1870a859783925e95b15bf5e83584">faiss::HNSW::shrink_neighbor_list</a></div><div class="ttdeci">static void shrink_neighbor_list(DistanceComputer &amp;qdis, std::priority_queue&lt; NodeDistFarther &gt; &amp;input, std::vector&lt; NodeDistFarther &gt; &amp;output, int max_size)</div><div class="ttdef"><b>Definition:</b> <a href="HNSW_8cpp_source.html#l00235">HNSW.cpp:235</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>
